2. (20 points) In this problem, we consider completely full binary trees with N nodes and height H (so that N=2H+11.) a. (5 points) Show that the sumOfHeights( T) (i.e, sum of the heights of all of the nodes of such a tree) can be expressed as: sumOfHeights (T)= k=0Hk2Hk b. (15 points) Prove by induction on H that the closed form for the summation in (a) is NH1, i.e., that sumOfHeights (T)=NH1. You may base your proof on the summation from part (a) (so you don't need to refer to trees at all), or you may do our "standard" binary tree induction based on the subtrees (using the definition that a non-empty binary tree has a root plus left and right subtrees). We find the tree approach more straightforward, but you may use the summation if you prefer