1. [Strange Sorting, 24 points For each of the following algorithms 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 a. oneA(Array A[0..n-1]) for ii-0 to n/2 for jj-n-1 down to n/2 if (A[ii]>ALj) swap(Alii],ALiil) b. oneB(Array A[ii.jj]) f (iiij) return else smallest- ii for loop-ii to ij f (A[loop]ALj) swap(Alii],ALiil) b. oneB(Array A[ii.jj]) f (iiij) return else smallest- ii for loop-ii to ij f (A[loop]