Problem 8 A rooted tree is called a ill m-ary tree if its root and internal vertices have exactly in children (each of them has precisely m children). [has = 3, then the tree is called as a full Iggy tree. The level of a vertex in a lll m-ary tree is the number of edges on a unique path between such a vertex and a root. The height of a rented tree is the largest level that may exist in such a tree. An m-ary rooted tree with h levels is called a balanced m-ary tree if all of its leaves are at level It or 1 L (a). [5 points] A leaf in a rooted tree is a node that has no child. Draw (if any) an example of a 11111 and balanced ternary tree of height 3 with eleven leaves. (b). [5 points] Determine the height of a ll] and balanced ternary tree that has 241 leaves