Balancing AVL Trees Name: (a) Insert the following sequence of elements into an AVL tree, starting with an empty tree: 60,50,80,95,35,20,40,90,98,45,120. In that order starting with 60 . When an insertion causes the tree to be unbalanced, stop, indicate the unbalanced node, and show all balancing steps before inserting the next element. (b) Delete 20 from the final AVL tree that you got in a. Show the balancing steps, if any