Assume this tree is a binary search tree even though you cannot see what the keys and values are at the nodes (the letters we write below are just names for the nodes for the purpose of answering the questions). (3 points each) Picture1.png (a) What is the depth of the tree? (b) what is the result of the post order traversal of this tree? (c) What is the maximum number of nodes that could be added to the tree without increasing its height? (d) Is the tree an AVL tree? (e) If we remove only node H, is the result an AVL tree? (f) If we remove only node J, is the result an AVL tree? (g) If we remove only node K, is the result an AVL tree?