Huffman Coding (12 points) 5 Hint: Consider what you learned for HW14. Suppose the following is the output of the header of a file compressed using Huffman coding This header specifies the Huffman tree using post-order traversal. 0000000: 10110011 11011011 11010111 00111001 00000010 11001011 0000006: 01101000 01011100 00101110 01000000 expressed Suppose the following shows the data (only the beginning) using the Huffman tree above. 0000000: 00011110 11111101 10011010 11001101 11001110 Write down the letters of this message. Huffman Coding (12 points) 5 Hint: Consider what you learned for HW14. Suppose the following is the output of the header of a file compressed using Huffman coding This header specifies the Huffman tree using post-order traversal. 0000000: 10110011 11011011 11010111 00111001 00000010 11001011 0000006: 01101000 01011100 00101110 01000000 expressed Suppose the following shows the data (only the beginning) using the Huffman tree above. 0000000: 00011110 11111101 10011010 11001101 11001110 Write down the letters of this message