Suppose that an expression tree has five external nodes storing the integers 2, 3, 8, and 9. Each integer is stored one per external node, but no necessarily in this order. The expression tree has three internal nodes that each store an operator (+, , x, and /) such that the value of the root node is 36. Draw the expression tree. See Figure 2.4.3 in Section 2.4.