Problem 3. Prove the correctness of the following program, which is supposed to return the largest number in a given array A. procedure FindMax(A, n) **Returns the largest element in A[1..n] index +1 for (j from 2 to n) if (A[j] > A[index]) index + j return A[index] Hint: Consider LI: At the beginning of each loop-iteration, A[index] max{A[1], A[2], ..., A[j 1]}