6. (15 p) Insert the following integer keys into an AVL tree. After each balancing (rotation) operation, write which rotation you have performed and show the AVL tree. 50, 40, 25, 10, 15, 5, 45, 35, 20, 30 7.(10 p) Convert the given general tree into a binary tree. Show each step. A B -u E F G H