Suppose you have a message that contains only the following seven letters, with the listed frequency counts:

Build the Huffman tree for these characters. Remember that when you combine two 'nodes', put the one with the lower frequency count to the left. Prove that you got the right tree by decoding the following English word (if you get gibberish, you did something wrong!):

0111101010001111100

type in the word using only lowercase letters.

Suppose you have a message that contains only the following seven letters, with the listed frequency counts: Symbol Frequency 28 C d 43 e 127 O 75 r 60 S 63 > 10 Build the Huffman tree for these characters. Remember that when you combine two 'nodes', put the one with the lower frequency count to the left. Prove that you got the right tree by decoding the following English word (if you get gibberish, you did something wrong!): 0111101010001111100 Type in the word using only lower-case letters. Suppose we represent the word record using your tree. How many bits would be saved for this word, compared to a representation using a minimal fixed-length code for this alphabet (i.e., the letters c, d, e, o, r, s, and v)? That is, calculate the length of the representation for the word record using a minimal fixed-length code minus the length of the representation for it using the Huffman code. Type in your answer as a number. Which of the following codes could never be the result of Huffman coding? (A) Symbol Code Ja 10 b 10 c (B) Symbol Code 00 lb 10 IC 111 d 01 C Symbol Code a 1001 lb 01 C 11 d 000 e 10 (D) Symbol Code la 111 b 10 C 100 d 011 e 0101 0100