The following string gives the grade assignment in a course. Give a Huffman code for this string. Give both the tree and the actual binary encoding of the string. AAABAABAACAABAACACAACBAACBDDFA You should perform the following steps to arrive at your solution: a) Compute the frequency for each grade. b) Run/Trace the Huffman tree algorithm to construct the optimal Huffman tree c) Give the code for each grade. d) Write down the encoding for the entire string