For this problem consider the problem of finding the median of integers in two sorted lists of

size n. Let M(A,B) express the output to this problem.

2.3 EXPAND For this problem consider the problem of finding the median of integers in two sorted lists of size n. Let M(A,B) express the output to this problem. (1 point) 1. Express this problem formally with input and output conditions. (2 points) 2. Describe a simple algorithm to compute the median. How many operations does it take asymptotically in the worst case? (3 points) 3. Show how you can use the medians of the two lists to reduce this problem to its sub- problems. State a precise self-reduction for your problem. (3 points) 4. State a recursive algorithm that solves the problem based on your reduction. (1 point) 5. State a tight asymptotic bound on the number of operations used by your algorithm in the worst case. Grading You will be docked points for errors in your math, disorganization, unclarity, or incomplete proofs