Guidelines for writing pseudocode:

1. C/Java/Python instructions are fine. But do not write object-oriented additions. Do not declare or use any class. Declare only procedures (if necessary) and explain in words what each procedure does, and what is the use of each parameter.

2. One instruction per line

3. Match the brackets with a horizontal line

4. Number your lines

5. Write down if your array is indexed 0...n1 or 1...n.

6. If you decide to use procedures/functions/methods from the class (such as, say, DELETE- MAX(S) for S a max-heap), explain clearly what they do and in what running time. Explain the data structures, if any.

Question: Suppose we are given two sorted arrays S and T, each with n items. 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). Present pseudocode, argue correctness and analyze the running time.