I have a trouble this questions. Please help me.

Data Structures 1. Which data structure is best for the following situations (fill in the blank) Select from: LLL, CLL, DLL, LLL of Arrays a. Is best when there is a current position allowing movement back and forth through the data Is best when we need exibility in memory and direct access 53" Suffers om run-time issues with traversal overhead 0-9 Is best when we add at the end with a tail pointer and Should always have a tail pointer and Supports the notion of removing at the end Pointer arithmetic can be used to improve run-time performance P'CFIH'!\" Support accessing the last and the rst all through one pointer 2. Selecting Data Structures We have talked this term about dynamically allocated arrays, linear linked lists, circular linked lists, doubly linked lists and linked list of arrays. Each of these has their strengths and weaknesses. In the following situations, explain why the specied data structure SHOULD BE SELECTED: Limit your answers on this exam to 1-2 sentences AT MOST! a. The data structure selected is a LLL and Memory is most important: b. A dynamically allocated array is selected and run time performance is most important