Recall the Huffman Coding algorithm presented in class. In answering the following questions, refer to the table below, which describes a data file containing a total of 2,100 characters, consisting of a, b c, d, e, and f. symbol a frequency 400 code word b 300 200 d 100 e 500 f 600 (35 points). Apply Huffman Coding to determine the code words for the symbols in the table above. Carefully show your final decision tree, including the frequency counts in each node. Provide your code words in the table above.