# A discrete memoryless source has an alphabet of seven symbols whose probabilities of occurrence are

A discrete memoryless source has an alphabet of seven symbols whose probabilities of occurrence are as follows: Symbols: s1s2s3s4s5 6 Probabilities: 0.25 0.25 0.125 0.125 0.125 0.0625 0.0625 Determine the Huffiman code for this source by moving a “combined” symbol as high as possible. Compute the efficiency of this code and discuss it.