Question 3 We would like to use the Huffman Coding algorithm to find an optimal coding scheme for the following characters with the corresponding fre- quencies cc.freq A 75 B11 C39 D 30 E 146 F 33 G48 H41 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