3 (9 pts) In class, we showed the correctness of the insertion sort algorithm using a loop invariant, i.e., we showed that the three properties of initialization, maintenance, and termination held, and were then able to conclude that the entire array was sorted. Consider the following algorithm given by pseudo code. You can assume that the input array A has at least one element. FUNCTION1 (A) //A is an array of length n n=length[A] 2) 1) s=A[1] 3) for (i=2; i