MY_SORT(A) 1 for j 1 to n-1 2 forin downto i+1 4 exchange Ai] with Ai-1] Here, n is the size of the array A. Prove the correctness of the above sorting algorithm using the loop invariant method discussed in the textbook. First, you need to identify and state a loop invariant (which is true with regard to the outer for loop, lines 1 through 4). Initialization: Prove the loop invariant is true at the start of the first iteration. Maintenance: Assume that the loop invariant is true at the start of the k-th loop and prove that it is also true at the start of the (k+1)-th iteration. Termination: Prove that at the termination of the last iteration, the whole array is sorted (using the proved loop invariant). This proves that the algorithm is correct