Consider the following algorithm that returns the number of occurrences of target in the sequence A. Identify a useful invariant that is true at the beginning of each iteration of the while loop. Prove that it holds, and use it to prove that the algorithm is correct. 1: function COUNT(A[1..n], target) 2: 3: 4: 5: 6: 7 8: 9 10: 11: end function count=0 i=1 while in do if A[i] target then n count end if i=i+1 end while return count count + 1