(a) (10 pts) Make a binary search tree by inserting the numbers 18,42,49,58,11,15,12,9,10, 2,25,1, and 17 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? (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