Let S be an alphabet for which maxx sfx SolutionAnswer Creat

Let S be an alphabet for which max_x s(f_x)

Solution

Answer:

Create a terminal node for each ai o , with probability p(ai ) and let S = the set of terminal nodes.

Select nodes x and y in S with the two smallest probabilities.

Replace x and y in S by a node with probability p(x) + p(y). Also, create a node in the tree which is the parent of x and y.

Repeat (2)-(3) untill |S|=1.