A. [16 points] Answer the following questions using this BST: 1. (1 pt) The depth of node 50 is: 2. (1 pt) The height of the tree is: 3. (1 pt) The tree is perfect (True/False): 4. (1 pt) The balance factor of node 50 is: 5. ( 2 pts) The pre-order traversal of this tree is 6. (1 pt) Show on the tree the insertion position of 19. 7. (1 pt) The range of all possible valid values for the root is (using the original tree): 8. (2 pts) Redraw the original tree after deleting the root. 9. (2pts) If the original tree is unbalanced, redraw it after applying the appropriate rotation