Problem 2 Loop Invariants Consider Following Binary Search Algorithm Qrequires Indicate Pr Q37041154

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); /*0ensures (-1-result && ! is-in(x, A, 0, n))11 ((0 <= result

OR

 

OR