1. a) Insert the following elements, in order, into a Binary Search Tree: 8, 10, 7, 4, 9, 1, 3. b) What is the resulting Binary Search Tree after the "10" is deleted? c) Construct a Binary Search Tree that contains all 7 original elements, but is balanced. d) In what order should the elements be inserted to produce this balanced tree? e) True or False: The node in a BST with the smallest key never has "children". Why or why not