Examine the following binary search tree and answer the question. The numbers on the nodes are values in the key of the items in the tree. What is the height of the tree? What nodes are on level 2? Which levels have the maximum number of nodes that they could contain? What is the minimum height of a binary search tree containing these nodes? What is the maximum height of a binary search tree containing these nodes? Trace the path that would be followed in searching for a node containing Show the order in which the nodes in the tree are processed by a preorder traversal of the Implement the following Tree Type member function Ancestors that prints the ancestors of a given node whose info member contains value. template void TreeType :: Ancestors (ItemType value)//Pre: A node whose info member is value is in the value)//Post: The ancestors of the node whose info member is value have been printed. {TreeNode * location = root