Afull binary tree has 24 leaves. deduce a lower bound for its height. (b) let t be a full 4-ary tree of height h, where h > 0. assume that t has 78 internal vertices. i. how many vertices does t have? ii. deduce a lower bound h for the height of t. iii. assume t is balanced and of height precisely this lower bound h computed in ii. for each level of t, identify the total number of internal vertices and the number of leaves.