Let T be a parse tree for an expression with only unary and binary operators, and let m be the number of primitive elements in the expression. Prove that if m > 1, then there exists a node x of T such that the subtree rooted at x contains at least m/3 of the primitive elements and at most 2m/3 of the primitive elements.