Answer it !

Assume the array A has indexes A[1..n]. 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-ALG(A, n) 1. for i=n down to 2 2. // move the largest element in A[1i] to A[i] 3. for j=1 to i1 4. if A[j]>A[j+1] 5. exchange A[j] with A[j+1]