rove the correctness of the following algorithm. The desired structure of your proof is given below the pseudocode please answer each part). ef reverse(lst): "*"PRECONDITION: a nonempty Python list lst of length n POSTCONDITION: Ist is reversed in place 1 st =[1,2,3] reverse(1st) 1st=[3,2,1] True True 1. State the loop invariant. 2. Prove the loop invariant. 3. Use the loop invariant to prove postcondition is satisfied. 4. Show that the algorithm terminates