Determine the code words that correspond to each letter a, b, c, d, e, f for the prefix code represented by the following tree. Explain why the following tree does not represent an optimal Huffman Code, no matter what frequencies are assigned to the letters. (Demonstrate that you can find a code that will use fewer bits, regardless of frequency.) Can you state a general property that all optimal trees must share