3. Selection Sort can be thought of as a recursive algorithm as follows: Find the largest element and put it at the end of the list (to be sorted). Recursively sort the remaining elements. That is, F(n) = F(n-1) + some operations.

a. Write down the recursive version of Selection Sort in psuedocode.

b. Derive a recurrence for the exact number of comparisons that your algorithm uses.

c. Use the iteration method to solve the recurrence. Simplify as much as possible.