Write a proof by induction to show the correctness of the binary search code given below:

2. Write a proof by induction to show the correctness of the binary search code given below: /1 Find index of x in sorted array A[p..r]. Return -1 if x is not in A[p..r]. int binarySearch ( A, p, r, x) Pre: A[p..r] is sorted if p>r then return -1 else q (p+r)/2 if x