Argue in more detail about why the merge-sort tree has height
O
(log
n
).