2.3a** Explain how the loop invariant in the algorithm shown below helps to establish that the algorithm will return the correct result regardless of input. Ascending (A) y true For i1 to A1 > LI: y is true iff >A[1..I1] sorted if A[i]>A[i+1] yfalse Return y > Post: y= true iff A is sorted