Assume the tree below is a 2-3 tree. The circles are 2-nodes, and the ovals are 3-nodes. The letters are for identification only. They are not to be taken as any indication of the actual values in the nodes. In fact, the node values are not visible; but you are given that none of the node values are the same. If the node values were visible, which node would contain the smallest value? Which node would contain the largest value? Explain how you reached your answers.