For a Full Binary Tree T, we use n(T), h(T), and i(T) to refer to number of nodes, height, and number of internal nodes (non-leaf nodes) respectively. Note that the height of a tree with single node is 1 (not zero) Using structural induction, prove the following ) ar every ull BTreT 2c)-1. (b) For every Full Binary Tree T, i(T)- (n(T) - 1)/2 Your proof must use structural induction