Given two SORTED (in ascending order) arrays A[1..n] and B[1..n], each containing n numbers, give an O(log n)-time algorithm (again, counting the number of comparisons) to find the median of all the 2n elements in arrays A and B.