71. Suppose a Huffman tree has been used to create a binary code for the letters through , and the results include , , and . If the code has only two code words of length 6 and one of length 5, what can you say about the probability of the occurrence of the letters , , and ?
71.
is the least likley, is the second least likely, and is the third least likley.