What is the maximum number of nodes that a binary tree can have at level n? Prove your answer by using mathematical induction. Use this fact to do the following:
a. Rewrite the formal definition of a complete tree of height h.
b. Derive a closed form for the formula.
What is the significance of this sum?