Question: Question 2 (Huffman Coding (5 points)) We would like to use the Huff- man Coding algorithm to find an optimal coding scheme for the following

Question 2 (Huffman Coding (5 points)) We would like to use the Huff- man Coding algorithm to find an optimal coding scheme for the following char- acters with the corresponding frequencies B C D E F G c.freq 75 11 39 30 146 33 48 H 41 1. Construct the Huffman Tree according to the table above. 2. Find prefix codes for the characters A through H. 3. Use the codes found in (b) to encode the message "HEADACHE. 4. Is the encoding you computed in (c) optimal? Why or why not
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
