2. An Alternating Three-Two Tree (A32 tree) is a complete tree in which every node at even depth has three children, every node at an odd depth has two children, and all leaves are on the same level. Note that the root is at depth 0 and therefore will have 3 children. Prove (or disprove) that an A32 tree of height h contains less than 6h/2 +6h/2 nodes. We assume that the height of a tree that has only the root node is equal to zero