Suppose we are given two ordered dictionaries S and T, each with n items, and that S and T are implemented by means of array-based ordered sequences. Describe an O(log² n)-time algorithm for finding the kth smallest key in the union of the keys from S and T (assuming no duplicates).