Let A[1..n be an array with n elements. Consider the Count-Occurrence algorithm with the pseudocode below. Count-Occurrence(A, n.k) 1. count=0 2.orj = 1 to n 4. 5 print count, j if A[j] = k count = count + 1 Which of the following is the correct loop invariant for the for loop? At the start of each iteration j of the for loop, count represents the number of times that k occurs in the subarray A[1] O At the start of each iteration j of the for loop, count represents the number of times that k occurs in the subarray A[1-1]. O At the start of each iteration j of the for loop, count represents the number of times that k occurs in the subarray Ai-1.. .n]. At the start of each iteration j of the for loop, count represents the number of times that k occurs in the subarray Ai..n]