Find the worst case time complexity for the following cases: Give both the equation AND the Big-O notation when time complexity is asked for. 1. for func2 if you were to implement the solution using a...

kindly answer the following:

Extracted text: Find the worst case time complexity for the following cases: Give both the equation AND the Big-O notation when time complexity is asked for. 1. for func2 if you were to implement the solution using a Stack? 2. for funcl if you were to implement the solution using a Single Linked List? 3. for func2 if you were to implement the solution using a Doubly Linked List? 4. for funcl if you were to implement the solution using an Array? 5. for func2 if you were to implement the solution using a Dequeue? 6. What is the best Linear data structure for implementing this program (choose one from the five mentioned in 1-5). Justify your answer in 2-3 sentences.


Extracted text: Given a list of X objects, you want to create a program that performs the following operations: • funcl Get the first (F) and last (L) object and place them both at the start of the list. e.g. ABCDE becomes AEBCD • func2 Get the first (F) and last (L) object and place them both at the end of the list. e.g. ABCDE becomes BCDAE Assume that the size of the list will never change once initialized.