Suppose you have a sorted array of integers (3,7,12,15,18,21…

Suppose you have a sorted array of integers (3,7,12,15,18,21,27,33,39,42,50) and you want to implement the binary search algorithm given below to find the index of a target value x. For each target value x given below, give the values for variables low and high for each call to Binary Search. Then give the final return value.    a)  x=12 b) x = 32