Question:

There are two sorted arrays A and B of size m and n respectively. Merge
these two sorted arrays. The time complexity of your solution should be
 O(log(m+n)).