(This problem was suggested by P.F. Swaszek.)
(a) For a binary source with probabilities P(0) = 0.9, P(l) = 0.1, design a Huffman code for the source obtained by blocking m bits together, m = 1, 2, . . ., 8. Plot the average lengths versus m. Comment on your result.
(b) Repeat for P(0) = 0.99, P(l) = 0.01. You can use the program huf f_enc to generate the Huffman codes.