1. [Strange Sorting, 24 points] For each of the following algorithms: i. Provide the result when the algorithm is run on the array [9,8,7,6,5,4,3,2,1,0]. ii. Does this algorithm correctly sort all arrays of positive n integers? iii. If your answer to (ii) is yes, provide a short explanation along with a worst-case asymptotic running time. If the answer to (ii) is no, give a short counter-example. c. oneC(Array A[O..n-11) for ii= l to n-1 partition(A,0,i) The procedure partition is as defined in your course text: PARTITION(A, p,r) 1 x =A[r] i=p- for j=pto r-1 3 4 if Ax i=i+1 exchange Ali] with ALi) 6 7 8 exchange A [i + 1] with A[r] returni +1