Using the following binary search tree as the starting point for each part, draw the tree that results after the given operation. Sean's Rule for Deletions of nodes with two children in BSTs is to take the minimum of the right subtree. 10 20 30 43 50 52 a. Assuming it is an AVL tree, delete 43. b. Assuming it is an AVL tree, insert 55 c. Assuming it is a splay tree, delete 54. d. Assuming it is a splay tree, insert 5. 54 56 58 60 62 65 73