Use a loop invariant to prove that the following algorithm correctly identifies the location of the minimum value in the array data.

Input: data: array of integers

Input: n: size of data

Output: index min such that data[min] <= data[i] for any i from 1 to n

Algorithm: FindMin

min = 1;

for i = 2 to n do

if data[i] < data[min] then

min = i;

end

end

return min