PROBLEM 4: A complete binary tree of height h has exactly 2h+1-1 nodes. In a ternary tree, nodes can have up to 3 children. Prove by induction that a complete temary tree of height h has exactly nodes for all h 2 0. Examples 3h+1 1 h-0 h-1 h-2