申論題

8. Suppose that a 12000-character article is composed of only alphabets I, J, K, L, M, and N, which appear 5400, 1560, 1440, 1920, 1080, and 600 times, respectively. Please draw the Huffman coding trees for fixed-length codeword and variable-length codeword.