State the loop invariant precisely.

Use the loop invariant to prove that the algorithm is correct as defined above.

Algorithm LONGEST SEGMENT Input: A nonempty array of n real numbers A [1 nl and a lower bound L output: The start and end index of the longest segment of A with sum at least L. C[0... n] and M[0 n] are arrays of size n 1, as defined in the context. 1 M[0] 2 for 1 to n do A[i] 4 if C 1]