If possible could you also clarify what exactly the Huffman Coding is? Suppose we have a file

If possible could you also clarify what exactly the Huffman Coding is? 

Transcribed Image Text:

Suppose we have a file that contains 10 a, 15 e, 12 i, 3 s, 4 t, 13 blanks, one 0 and one newline. Using the Huffman Coding algorithm with a binary tree representation: (a) Compute the optimal coding for each character. (b) What is the size of the compressed file in this case? Suppose we have a file that contains 10 a, 15 e, 12 i, 3 s, 4 t, 13 blanks, one 0 and one newline. Using the Huffman Coding algorithm with a binary tree representation: (a) Compute the optimal coding for each character. (b) What is the size of the compressed file in this case?