Consider the following algorithm which may be used to sort the integer array A[0n1] (of unique elements) into ascending order. where the method swap (A, i, j) exchanges the elements of A at indices i and j. Assuming the core operation is the comparison between elements of A which occurs within minIndex, determine exactly the complexity of this algorithm as a function of n when applied to the array A[0,n1]