$4\mathrm{.}5$ Show that the maximum number of nodes in a binary tree of height $h$ is $2^{h+1}-1.$

$4\mathrm{.}6$ A full node is a node with two children. Prove that the number of full nodes plus one is equal to the number of leaves in a nonempty binary tree.