Exercise $2$ BST Examples $(20$ points$)$

For each of the following heights, state an ordering of insertions of the integers $1,2,3,4,5,$ and $6$ that will result in a binary search tree with that height and draw the resulting binary search tree $($a$)$ A height of $2($b$)$ A height of $3.($c$)$ A height of $4.($d$)$ A height of $5.$