Answer the following questions about the tree T below: 13 46 37 50 15 44 57 67 T 1. Label each node in T with its balance value. 2. Draw the tree that would result from rotating 50 to the left. You do not need to label balance values for each node. 3. Draw the tree that would result from rotating 37 to the right, starting from T. Balance values are not required. 4. Draw the tree that would result from inserting 62 into T, using the AVL tree insertion algorithm. Do indicate balance values for each node. 5. Draw the tree that would result from inserting 14 into T, using the AVL tree insertion algorithm. Do indicate balance values. 6. Draw the tree that would result from deleting 44 from T, using the AVL tree deletion algorithm. Do indicate balance values. 7. Draw the tree that would result from deleting 50 from T, using the AVL tree deletion algorithm. Do indicate balance values.