Suppose that you have two sorted numerical arrays A[1m] and B[1n]. You want to compute the k 'th smallest number in the merged array of all m+n elements. Design a divideand-conquer algorithm that can do so in O(log(m+n)). You can assume for simplicity that k is even