Give an O(logn)-time solution for the previous problem.

Previous problem

Suppose we are given two sorted search tables S and T, each with n entries (with S and T being implemented with arrays). Describe an O(log² n)-time algorithm for finding the k^th smallest key in the union of the keys from S and T (assuming no duplicates).