My main problem is with part B...

A proper d-ray tree, with d greaterthanorequalto 1. is a tree where every node has either 0 or d children. Draw two proper ternaries (d = 3) trees T_1 and T_2 with 8 internal nodes each and such that T_1 has the maximum possible height and T_2 has the minimum possible height. How many leaves do T_1 and T_2 have? Let T be a proper d-ray tree with n nodes, m of which are leaves, and of height h. Which one of the following relations can be true for any T? m = (d - 1)^h + 1 m = d(n - m - 1) - 1 m = (d - l)(n - m) + 1 Prove the relation guessed in (b)