In each of $($a$)$ and $($b$),$ use the steps of Algorithm $10\mathrm{.}5\mathrm{.}1$ to build a binary search tree for the given keys. Use numerical order and

insert the keys in the order they are listed. The elements in the lists are the same, but the trees are different because the lists

are ordered differently. $($Enter NONE in any unused answer blanks.$)$

$($a$)14,29,22,4,16,6,5$

$($b$),14,5,4,22,16,29,6$