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. b. oneB(Array A[ii..j if (ii=-j) return else smallest = ii for loop-ii tojj if (A [loop]