Consider $2n$ numbers organized in two arrays $A[1..n]$ and $B[1..n]$ both of size $n$ each. Also,

both these arrays are sorted. Your task is to find the median of these $2n$ numbers. Median

of $k$ numbers is defined as ${|}_{{?}_{?}}\frac{k}{2_{{?}_{?}}}|$ th smallest element. You can assume $n$ to be a power of $2.$

What is the fastest algorithm that you can design to find the median?