Using the symbols 0, 1, and 2 use ternary (m = 3) Huffman coding to encode these letters with the given frequencies: A: 0.25, E: 0.30, N: 0.10, R: 0.05, T: 0.12, Z: 0.18.
Consider the three symbols A, B, and C with frequencies A: 0.80, B: 0.19, C: 0.01.
a) Construct a Huffman code for these three symbols.
b) Form a new set of nine symbols by grouping together blocks of two symbols, AA, AB, AC, BA, BB, BC, CA, CB, and CC. Construct a Huffman code for these nine symbols, assuming that the occurrences of symbols in the original text are independent.
c) Compare the average number of bits required to encode text using the Huffman code for the three symbols in part
(a) and the Huffman code for the nine blocks of two symbols constructed in part
(b). Which is more efficient?