![3. Prove that (hi == n11Ahi] > x) is indeed a loop invariant 4. What is the terminal condition of the loop? 5. Using termimal](https://media.cheggcdn.com/media%2F8aa%2F8aaa2916-ec67-41ad-9638-0beb97cd8b58%2Fphpec7Baf.png)
Problem 2 Loop Invariants Consider the following binary search algorithm. The Qrequires indicate pre-conditions and Qensures indicate post conditions int binsearch(int x, int[] A, int n) //orequires 0<n && n <length(A); //orequires is_sorted (A, 0, n); /*Qensures (-1 result && !is in(x, A, 0, n))|I ((0 result result n) A[result] -x) ; &&
OR
OR