Consider an empty AVL Tree. Insert the following elements one by one: 3, 15, 2, 7, 8, 11, 9. Show (draw) the result after each insertion. Do not forget to maintain all properties of the AVL tree. 2. (30 pts.) Consider an AVL tree you just built in question 1 (final result). Romove the root of that AVL troo throo times. Show (draw) the result aftor each dolotion. Do not forgot to maintain all proportios of the AVL troo. 3. (15 pts.) Consider an AVL troo from question 2 (final rosult), thon without codo, provido: pre-order traversal of the troo in-ordor travorsal of the troo post order traversal 4. (15 pts. ) Writo a mothod that will calculato number of nodes without children in AVL troo. Submission: Submit word or .pdf filo containing questions 1-4. through the Blackboard according to deadline