a$.$ Prove that a full binary tree with $x$ internal nodes has $2x+1$ total nodes.

b$.$ Prove that a full binary tree with $x$ internal nodes has $x+1$ leaves.

c$.$ Prove that a full binary tree with $n$ nodes has $\frac{n-1}{2}$ internal nodes and $\frac{n+1}{2}$ leaves.