Consider the following Huffman Tree encoded with fixed-length codewords.

A: How would this tree encode the string jadedfad?

B: How many bits would the original string jadedfad have required, assuming one character = one byte? How many bits would the encoded version require?

C: How would it decode the string 100001100101011000001111001 ?

b c 0 N j k