Linear Data Structures Given a list of X objects, you want to create a program that performs the following operations: • 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. 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. 3. if you were to implement the solution using a Doubly Linked List? a. Equation: b. Big-O notation:

Recall that a bit string is a string of Os and 1s Describe the following sequence recursively. Include initial conditions and assume that the sequences begin with a₁. a₁ is the number of ways to go down an n-step staircase if you go down 1, 2, or 3 steps at a time.

Given three sequences of length m, n, and p each, you are to design and analyze an algorithm to find the longest common subsequence (LCSS) for the three sequence. Is it possible to use dynamic programming to find the LCSS between the three sequences? If yes, provide recursive solution to the above problem.

Choose an algorithm of minimum 15 lines using c++, then calculate the complexity (Big O) and show the details of your calculations.