STUDYING, NEED THIS DONE IN WELL HANDWRITING. WILL RATE AS WELL

The following is a pseudocode of Insertion-sort. Prove its correctness via loop invariant. In other words, state the loop invariant and prove it using Initialization/Base case, Maintenance/Inductive Step, and Termination/Conclusion. for j key = Insertion-Sort (A) 1. 2 to A.length 2. A[j] 3. // Insert A[j] into the sorted sequence A[1...j - 1]. 4. i = = j - 1 5. while i > O and A[i] > key 6. A[i + 1] A[i] 7. i = i 1 8. A[i + 1] key =