1. Loop Invariant (5 points) Use the loop invariant (I) to show that the code below correctly computes the product of all elements in an array A of n integers for any n 2 1. First use induction to show that (I) is indeed a loop invariant, and then draw conclusions for the termination of the while loop Algorithm 1 computeProduct (int]A, int n) p=a[0] i=0 while i