Question 2 10 pts Consider the SORTING-ALG described below using pseudocode. State the correct loop invariant for the for loop in line 3 (i.e. lines 3 to 5). SORTING-ALGCA,n) 1. for i = n down to 2 Z. // move the largest element in A[1..i] to A[i] 3. for j = 1 to 1-1 if A[i] > A[j+1] 5. exchange A[j] with A[J-1]