Exercise $1$ Binary Search Tree Example $(25$ points$)$

The intention is that you complete this exercise by hand. The answers should be node and edge drawings scanned into a pdf file which is placed in this folder or file. You are encouraged to use code to check your work before submission.

$($a$)(10$ points$)$ Draw the binary search tree that results from inserting the following keys in the order given: $68,88,61,89,94,50,14,76,66,$ and $82.$

$($b$)(10$ points$)$ Draw the binary search tree that results from deleting $68$

$($c$)(5$ points$)$ Draw the binary search tree that results from deleting $82$

$($d$)(5$ points$)$ Draw the binary search tree that results from deleting $76$