Please give runtime and proof of correctness for the algorithm.

Problem 2 (25 points). Suppose you are given two sorted arrays, each with n elements lues in total, and you n would like to determine the median of this set of 2n values. We define the median as the nh smallest value. Give a divide and conquer algorithm which finds the median in asymptotic time (log n) Argue why your algorithm is correct. Write down and solve the running time recurrence