FORMAT:

Base case:

Inductive step:

Problem 2 (7 points) 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 [j] for any j from 1 to n 1 Algorithm: FindMin 2 min =1 3 for i=2 to n do 4 if data[i]