Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.

• A. O(m+n)
• B. O(mn)
• C. O(m)
• D. O(mlog n)