1. 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.

2) For sorting java program

Output the number in a sorted way. The sorting is done based on string sorting and not on numerical. (Eg:121 comes before 2 because the Most Significant Digit is 1 in 121 which is less than 2) disp(int low, int high); //used to generate some random numbers. disp(5, 1113); Required Output is: 10 100 1000 11 12 . . 19 101 102 .. so on