2. Identify and state a useful loop invariant in the following algorithms. You do not need to prove anything about it.

(a) FindMinElement(A) : //array A is not empty ret = A[length(A)] for i = 1 to length(A)-1 { if A[length(A)-i]

(b) LinearSearch(A, v) : //array A is not empty and has no duplicates ret = -1 //index -1 implies the element havent been found yet for i = 1 to length(A) { if A[i] == v{ ret = i }} return ret

(c) ProductArray(A) : //array A is not empty product = 1 for i = 1 to length(A) { product = product * A[i] } return product

2. Identify and state a useful loop invariant in the following algorithms. You do not need to prove anything about it. (a) FindMinElement(A) : //array A is not empty ret = A[length(A)] for i = 1 to length(A)-1 { if A[length(A)-i]