Insert, into an empty binary search tree, entries with keys $39,45,14,70,50,30,$

$20,17($in this order$).$ Draw the tree after each insertion.

Hint Recall the definition of where we perform an insertion in a binary search tree. You will need to draw $8$ trees, but they are all small.