5. Say we delete element 5 from the following AVL-tree 25 75 10 70 delete 5 45 65 76 83 95 (a) (1 point) After the deletion, what is the deepest node whose subtree is no longer an AVL Tree? (b) (1 point) What kind(s) of rotation is necessary? (c) (2 points) Draw the new tree after the rotation (d) (1 point) After the rotation do we have an AVL tree? If not, specify and perform any more needed rotations and draw the resulting tree 6. (3 points) Show the result of insert 5,1,19,25,17,21,20,9,15,14 into a BST using splay insertion. 7. (2 points) Perform a splay search(7) on the following BST and draw the result. 3 8 6