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