2.
Consider a source which generates symbols with probabilities (0.22, 0.21, 0.17,
0.15, 0.12, 0.06, 0.04, 0.03).
(a) Construct binary Huffman code by placing the composite symbol as low as
possible.
(b) Calculate code efficiency and redundancy.
[C02]