Selection in sorted arrays

Selection in sorted arrays As input you are given two sorted arrays A[1n] and Bli . . . m] of integers. For simplicity assume that all n + m values in the arrays are distinct. Describe and analyze an algorithm to find the kth ranked value in the union of the two arrays (where the 1st ranked value is the smallest element). The running time of your algorithm should be O(log(n m)) Note: If your analysis happens to give an O(log(n) +log(m)) running time, observe that log(n) + log(m) = O(log(n + m)). Hint: Recall Binary search and/for Quickselect