3. (20 pts) Add the following numbers one at a time to an initially empty AVL tree. Show what the tree looks like after each number is added. You will receive half credit if you create a BST in this manner without doing rotations. 10, 13, 12, 11, 15, 18, 8, 7, 6, 9 4. (20 pts) Add the same numbers from question 3 one at a time to an initially empty min heap. Draw what the heap looks like after each number is added.