algorithm question

Be sure to include:

Define the loop invariant

Initialization step

Maintenance step

what was shown

termination step

(a) Problem definition: Given a sequence A of size nn> 1, find two values m 1. m2 in A, with m1 >- m2, such that for all x in A- (m1), m2 >x The algorithm: Maximum2(A) mi = max(A[1], A[2]) m2 - min A[1]. A[21) for i = 3 to A.length if Alil > m1 m2 = mi mi - Ali else if Alil > m2 m2 - All return mi, m2 Prove the correctness of Maximum 2 using a loop invariant