Median of two arrays - divide to conquer

In O(log (n)) time, given two ordered arrays with the same sizeas input, build an algorithm that reports the median value,obtained after unifying the two arrays.

IMPORTANT: Use Java and demonstrate the recurrence equation andprove the complexity, prove by induction or by recursion tree.

Example:

Input:
5
1 12 15 26 38
2 13 17 30 45

Output: 16