a) Insert the following elements, in order, into a Binary Search Tree: 2, 5, 8, 10, 7, 4, 9, 1, 3. Draw the resulting tree.
b) What is the resulting Binary Search Tree after the "g" is deleted?
c) Draw a valid Binary Search Tree that contains all 9 elements but is balanced.