please use good penmenship

Let A[1.n] be an array with n distinct numbers. Consider the Find-Min algorithm, with the pseudocode below Find-Min(A.n) 1. min - A[n] 2. for i = n-1 downto 1 3. if Alij] min 4 5. print min min-Ai] 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 Ali-1...n] At the start of each iteration j of the for loop, min represents the minimum value in the subarray Alj+1...n] At the start of each iteration j of the for loop, min represents the minimum value in the subarray Alj...n) At the start of each iteration j of the for loop, min represents the minimum value in the subarray Alj-1...n-1]