BST $3.(20$ pts$)$

$($a$)(10$ pts$)$ Make a binary search tree by inserting the numbers $57,42,46,89,94,92,91,93,$

$35,70,23,$ and $98$ one at a time. You only need to show the final result, not each step.

$($b$)(5$ pts$)$ Include the height of each node.

$($c$)(5$ pts$)$ Is this an AVL tree? Why or why not?