(10 points) Write the pseudocode for an algorithm, we call it SortByMax, that receives as input an array A[1n] of numbers and returns the array A[1n] sorted. There may be repeated numbers n A[1n]. The algorithm uses the algorithm MAX from Question 1 and should make a single pass hrough A[1n] with a "for" or a "while" loop (it can make multiple calls to MAX at each iteration). (20 points) Prove that your pseudocode in Question 4 is indeed correct by: (a) Indicating the invariant (b) Proving the initialization case (c) Proving the maintenance case (d) Proving the termination case