Problem 3

2. Problem 2 (7 pts): Weiss 4.9-In part a show the tree after each insert- a total of 8 trees. In part b, we're doing full deletion, not lazy deletion. Show the tree after each step of the removal. 3. Problem 3 (7 pts): Show the same sequence of inserts as listed in the previous problem, except this time show the insertions into an AVL tree. Make sure to show each rotation. Note: There are no double rotations in this sequence