Write up a proof by structural induction of the following theorem. It refers to complete binary trees. Theorem: Let e represent the number of external nodes $($leaves$)$ and i the number of internal nodes $($non$-$leaves$)$ of a complete binary tree. Then e $=$ i $+1.$