Make a sorted integer array a [i]=i, i=0,...,n-1. Let bs (a,n,x) be a binary search program that returns the index i of array a[0..n-1] where a[i]-x. Obviously, the result is bs (a,n,x)=x, and the binary search function can be tested using the loop for (j=0; j