(Choose 1 answer)
Consider the binarySearch() function below:int binarySearch(int[] a, int x, int low, int high)
{ int t, k;
if(low > high) return(-1);k = (low + high) / 2;
if(a[k] = x) ret x) return(k);
if(x<a[k]) return(binarySearch(a,x,low,k-1);else return(binarySearch(a,x,k+1,high);
Suppose the array a is given by the statement:
} For the call binarySearch(a,7,2, 5), how many calls to this will be made, including the original call?
int a = {2,4,6,8,10,12,14, 16);
A. 3
B. 2
C. 4
D. 5
Exit 33
