Let A[1..n] be an array with n distinct numbers. Consider the Find-Min algorithm, with the pseudocode below. Find-Min(A.D) 1. min = A[n] 2, for j = n-1 downto 1 3. if Alil min 4. min = Ali] 5. print min Which of the following is the correct loop invariant for the for loop? At the start of each iteration j of the for loop, min represents the minimum value in the subarray Ai-1..n]. At the start of each iteration j of the for loop, min represents the minimum value in the subarray Ali+1..n At the start of each iteration j of the for loop, min represents the minimum value in the subarray A.li...). At the start of each iteration j of the for loop, min represents the minimum value in the subarray Ai-1..-1]