The following algorithm is a recursive version of MinSort, or selection sort, which takes as input an array A of n integers and returns an array with the elements of A sorted from smallest to largest. Using the same notation from lecture, let v degree C[1, ..., m] denote an array of length m + 1 where the first element is v and the rest is C[1, ..., m]. RecMinSort (A [1, ..., n]: list of n integers) if n = 1 then return A[1] m:= A[1] index:= 1 for i:= 2 to n if A[i]