This proof is for Advance Algorithms

Pls do not copy previous existing answers and show your work please

Thanks

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