Finding median in O(logN) and also provide analysis with pseudocode

C-9.10 Suppose you are given two sorted lists, A and B, of n elements each, all of which are distinct. Describe a method that runs in O(logn) time for finding the median in the set defined by the union of A and B