9. Construct the Huffman Coding tree for the following input frequencies: f(a) = .15, f(6) = .05, f(c) = .1, f(d) = .1, f(e) = .2, f(f) = .1, f(g) = .15, f(h) = .15 The height of the tree is: 2 3 4 5 10. For the same example, the number of leaves at the next to deepest level is: 3 5 6 6