Consider a complete binary tree whose bottom level is completely filled.

1. If the height of this tree is h, what is the number n of nodes in this tree?

2. In terms of n, how many leaves are in this tree?

3. In terms of n or h, how many ancestors does each of the leaves in this tree have?

4. Let d be the depth of a node in this tree. In terms of d and either n or h, how many descendants does each node in this tree have?