A discrete memoryless source has an alphabet of seven symbols whose probabilities of occurrence are as described here:
![215_Table 01.jpg](https://secure.tutorsglobe.com/CMSImages/215_Table%2001.jpg)
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%.