Chapter 11.2, Problem 37E

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.

37. Draw the subtree of the game tree for tic-tac--toe beginning at each of these positions. Determine the value of each of these subtre.es.