6. Let S be the set of full binary trees, defined recursively as follows: • Basic step: a single vertex v with no edges is a full binary tree To. • Recursive step: if T, and T2 are full binary trees,...

Extracted text: 6. Let S be the set of full binary trees, defined recursively as follows: • Basic step: a single vertex v with no edges is a full binary tree To. • Recursive step: if T, and T2 are full binary trees, then a new full binary tree T' can be constructed by taking T1 and T2, adding a new vertex v, and adding edges between v and the roots of T, and T2. Prove that n(T) is odd for any full binary tree T, where n(T) is the number of vertices of T.