Problem 2. Use structural induction to prove that e(T), the number of edges of a binary tree T, can be computed via formula e(T) 2(n(T)-1(T)) = where n(T) is the number of nodes in T and l(T) is the number of leaves. Note that a leaf is a tree node that does not have descendents (children nodes). You can use the following recursive definition for the set of leaves Basis step: If a tree has a single node, then it is a leaf (as well as a root Recursive step: The set of leaves of the tree T-T . T2 is the union of the set of leaves of T1 and T You can also use the fact that tree T = T12 adds two new edges when connecting Ti and T2 to the new common root. Provide detailed justification