Only solve part c and d of the question write recursive version of selection sort of the part c and write recurrence relation for the time complexity.?

Question 1 (12 points) The following recursive algorithm returns the index of the smallest element in a list A containing n elements. The elements in the list are assumed to start from index \# 1 : a) ( 2 points) Write a Recurrence Relation for the time complexity of this algorithm. b) (2 points) Solve the recurrence relation using the characteristic equation method. c) (4 points) Selection sort is one of the simple sorts that uses the following idea: find the min element and swap it with the element in first position, then find the second min and swap it with the element in second position, and so on. Below is its pseudocode as a reminder. Write a recursive version of Selection Sort (recSelsort (start.Index, A)), that calls on the recursive "recFindMin" above to find each minimum. Do not repeat the details of of recFindMin in your algorithm. d) (4 points) Write a Recurrence Relation for the time complexity of your recursive selection sort algorithm that you developed in c) above, then solve it to find its time complexity