Use structural induction to show that $(7),$ the number of leaves of a full binary tree T$,$ is $1$ more than $($T$),$ the number of internal vertices of T$,$ where an "internal vertex" is one with children.Click and drag expressions to complete the recursive step.#$($T$)+11(11)+1+12(12)+11$Suppose T$1$ and T are disjoint full binary trees.