Selection in Two Sorted Arrays. Let A[] and B[] be two sorted arrays with m and n items, respectively. Describe an algorithm that finds the i^th smallest item in the union of the two arrays. Your algorithm should run in O(log m + log n) time.

A) Give a high-level description of your algorithm.

B) Argue that your algorithm is correct.

C) Briefly justify the running time of your algorithm.