Prove that any binary tree of height h (where the empty tree is height 0, and a tree with a single node is height 1) has between h and 2h 1 nodes, inclusive. A binary tree is one in which every node has at most three edges (at most one to the parent and two to the children.)