Quiz: Advanced Binary Search

When finding the median of two sorted arrays, why do you binary search on the smaller array?

1. A.It guarantees $O(1)$ space
2. B.It minimizes the search space to $O(\log(\min(m,n)))$
3. C.It avoids integer overflow
4. D.It has fewer edge cases