Complete Chapter 19, Exercise 1a and 1e. You must show all of your work, graphically with arrows and/or numbered step descriptions for any credit.

Consider the following sequence of operations on an initially empty search tree: Add 10 Add 100 Add 30 Add 80 Add 50 Remove 10 Add 60 Add 70 Add 40 Remove 80 Add 90 Add 20 Remove 30 Remove 70 What does the tree look like after these operations execute if the tree is a. A binary search tree? b. A 2-3 tree? c. A 2-3-4 tree? d. A red-black tree? e. An AVL tree