Prove loop invariant.. please explain each step

Provide clear, concise answers to each of the following questions concerning the following code to perform a linear search through an input array: Linear-Search (A, low, high, item) found_index = 0 for i low to high if A[i] - item found_index return (folind_index) (20 points.) Carefully prove each clause of the following loop invari- ant: - (10 points). if (item Alow : 1 - 1]), then found index=0) if (item Allow :i-1]), then (item= A[found inder])