Problem 1: Consider the following binary search algorithm (a classic divide and conquer algorithm) that searches for a value X in a sorted N-element array A and returns the index of the matched entry: Binarysearch (A[0N1],X) \{ low =0 high =N1 while (low =( low + high) /2 if (A[mid]>X) high = mid 1 else if (A[mid]