a. Build a binary search tree of nodes: 11, 4, 18, 1, 9, 13, 33, 6, 14, 88 b. Deleting the value 11. Show both Predecessor and Successor methods c. Draw the AVL tree that results from inserting the keys: 4, 8, 9, 3, 5, 6 in that order into an initially empty AVL tree. Draw the intermediate steps. d. Draw the AVL tree that results from inserting the keys: 2, 8, 3, 9, 5, 4, 10. Draw the intermediate steps