Please follow the above (state why you chose the answer and why it is better than the others...if the other choices flat out would not work...explain why)

Of the three variations of linked lists (circular, with header and trailer nodes, and doubly linked), which would be most appropriate for each of the following applications? Why? In each case, what are the benefits of choosing one method over another? 1. You want to search a list for a key and return the keys of the two elements that come before it and the keys of the 2. A text file contains integer elements, one per line, sorted from smallest to largest. You must read the values from the 3. A list is short and frequently becomes empty. You want a list that is optimal for inserting an element into the empty two elements that come after it. file and create a sorted linked list containing the values list and deleting the last element from the list