Construct a Huffman code for the letters of the English alphabet where the frequencies of letters in typical English text are as shown in this table.

Suppose that m is a positive integer with m ‰¥ 2. An m-ary Huffman code for a set of N symbols can be constructed analogously to the construction of a binary Huffman code. At the initial step, ((N ˆ’ 1) mod (m ˆ’ 1)) + 1 trees consisting of a single vertex with least weights are combined into a rooted tree with these vertices as leaves. At each subsequent step, the m trees of least weight are combined into an m-ary tree.

1 2 51 re-0000000000000 NOPQRSTUVWXYZ 2 8444 re-0000000000000 ABCDEFGHlJKLM