1. Use the following as a model, 2 3 6 1 2 3 4 5 6 1 2 3 4 5 6 4 5 61 (a) 5 4 3 (b) 2. 5 4 6 1 3 (c) 24 5 6 1 3 2 3 2 3 4 1 2. 4 5 6 6 1 3 1 1 2 3 24 1 1 5 6 56 (d) 4 4 5 6 5 6 3 A 5 (e) 2 3 4 14 A illustrate the operation of INSERTION-SORT on the array A = {31, 41,59, 26, 41,58}. Rewrite the INSERTION-SORT procedure to sort into nonincreasing instead of nondecreasing order. You must show/explain your work. Simply stating the answers will result in 0 points awarded. (10 points each, 20 points in total.) INSERTION-SORT(A) 1 for j = 2 to A.length 2 key = A[j] 3 // Insert A[j] into the sorted sequence A[1.. j - 1]. 4 i = j-1 5 while i > 0 and A[i]> key A[i + 1] = A[i] 7 i=i-1 8 A[i + 1] = key 6