Question 2 18 points) a) Write a recursive algorithm to perform a linear sort (hint: if the list is of size n, assume you can magically sort n-1, then deal with the extra element. Don't forget the initial case) b) Write the Recurrence Relation for your algorithm c) Solve the Recurrence Relation using the Summing Factors technique giving the time complexity for the algorithm d) Give the time complexity in the simplest theta notation