Total =35 points 1. [2+1+2+2+1+1=9 points ] A discrete memoryless source has an alphabet of seven symbols whose probabilities of occurrence are as described in Figure 1. Compute the (a) Huffman tree, (b) Huffman code, (c) Average bit length, (d) Entropy and (e) Efficiency for this source, moving a "combined" symbol as high as possible. Explain why the computed source code has an efficiency of 100 percent