29. Assume that a dataset of four letters occurs with the following probabilities:
Use a Huffman tree to create a Huffman code for , , , and .
732
29.
is 0; is 111; is 10; is 110.