special case often occurs for insertion and deletion routines when list is assuming copy takes longer than comparisonis it faster to delete an item with certain key from linked list or from an unsorted array how many times would you need to traverse singly linked list to delete the item with the largest key of the lists discussed in this which one would be best for implementing queue which of the following is not trueiterators would be useful if you wanted to do an insertion sort on linked list insert new link at the beginning of list swap two links at arbitrary locations delete all links with certain key value which do you think would be better choice to implement stacka singly linked list or an arrayexperiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved use the linklist workshop applet to execute insertfindand delete operations on both sorted and unsorted lists for the operations demonstrated by this appletis there any advantage to the sorted list modify main(in the linklist java program (listing so that it continuously inserts links into the list until memory is exhausted after each , itemshave it display the number of items inserted so far this wayyou can learn approximately how many links list can hold in your particular machine (of coursethe number will vary depending on what other programs are in memory and many other factors don' try this experiment if it will crash your institution' network programming projects writing programs that solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied