A discrete memoryless source has an alphabet of seven symbols whose probabilities of occurrence are as described here:
Compute the Huffman code for this source, moving a "combined" symbol as high as possible. Explain why the computed source code has an efficiency of 100%.