Figure 1 Tree 1. (a) What is the depth of the tree in Figure 1. (1point) (b) Perform preorder, inorder, and postorder traversal for the tree in Figure 1. (3 points) 2. What is the maximum possible height of a binary search tree with 40 nodes? And what is the minimum possible height of a binary search tree with 40 nodes? What is the maximum number of nodes in a binary search tree of height 5? What is the average case time complexity of deleting a node from a binary search tree of size m? What is the worst case time complexity of inserting a node to a binary search tree of size m? (5 points)