Given two sorted lists Al1..n] and B.. We would like to find the median of the union of the two lists. For simplicity, assume that the union of A and B does not contain any duplicate items and that n is a power of 2. The median is the element at position n, i.e., the one that is larger than n 1 elements and less than n elements. (a) Propose a naive algorithm that finds the median in (n) running time