3. The following table gives the frequencies of the symbols in a particular document. с 20% d5% е 12% f6% g 15% h 14% і 3% 18% a 10% b790 (a) What is the optimum Huffman encoding of this alphabet? (b) If this encoding is applied to a file consisting of 1,000,000 characters with the given frequencies, what is the length of the encoded file in bits? Show transcribed image
OR
OR