Due Monday by 11:59pm Points 100 Submitting a file upload File Types zip Dear students, Please solve these two problems at home. These two problems will give you a nice idea about insert and delete operations in a BST and an AVL tree and will help you understand Project2 clearly. a1) Show the results of inserting 3146925 7 in this order, into an initially empty binary search tree (BST). a2) Then, show the result of deleting the root node of the final tree b1) Show the result of inserting 214593 6 7 in this order into an initially empty AVL tree. b2) When you perform a delete in an AVL tree, is it necessary to rebalance to make it an AVL tree again? Enjoy, Jagan File IInload Office 365