he internal nodes and leaves of a full binary tree are defined recursively as follows:

Basis Step: A full binary tree consisting of a single node has i $=0$ internal nodes and l $=1$ leaves.

Recursive Step: If T$1$ and T$2$ are disjoint full binary trees with i$1$ and i$2$ internal nodes and l$1$ and l$2$ leaves, respectively, then the full binary tree T consisting of a root r with T$1$ and T$2$ as its subtrees hasi$=$i$1+$i$2+1$internalnodesandl$=$l$1+$l$2$ leaves.

Prove the following statement:

LetT beafullbinarytree. IfT hasiinternalnodesandlleaves,thenl$=$i$+1.$