Only 9

Exercises In Exercises 1-6, find a Huffman encoding of the given probabil- ity distribution, using the source symbols A, B,C,... (in this order). Determine the savings over the most efficient fixed length code. 1. P-10.1, 0.2, 0.4, 0.2, 0.1) 2. P-(0.25, 0.25, 0.25, 0.24, 0.01) 4. P (0.05, 0.1, 0.55, 0.05, 0.1, 0.1, 0.05) 6. P (0.9,0.09, 0.009, 0.0009, 0.0001) 7. Write a computer program to implement Huffman encoding. 8. State a condition in terms of the sizes of the probabilities that guarantee uniqueness (up to switching Os and 1s) in Huffmarn encoding. 9. Determine all source probability distributions (pi.p2.ps.pa) that have (00, 01, 10, 11) as Huffman codewords. Hint: think about the Huffiman tree