Find the kth smallest element in two sorted arrays with complexity of (logn)^2 : <p>S and T are two sorted arrays  with n elements (integer) each ,describe an algorithm to find the kth smallest number in the union of two arrays(assuming no duplicates) with time complexity of (logn)^2. Note that it is fairly easy to find an algorithm with complexity of logn. </p>
