A full binary tree is a rooted tree where each leaf is at the same distance from the root and each internal node has exactly two children. Inductively, a full binary tree of depth 0 is the one-node tree N, and a full binary tree of depth d + 1 is a rooted tree whose two subtrees are each full binary trees of depth d. How many nodes, and how many edges, are in a full binary tree of depth d? Prove you answer