Given two sorted sequences with m, n elements, respectively, design and analyze an efficient divide - and - conquer algorithm to find the kth element in the merge of the two sequences. The best algorithm runs in time O(log (max(m,n))).