(Compression) Part A) Huffman Coding Assuming that a text file contains only the following characters with their corresponding frequencie Character Frequenc 28 3 1 10 25 21 a) [7 points] Build the Huffman code tree for the text file message. You should show all the steps of the tree construction b) [3 points] Use the Huffman tree to find the codeword for each character. [5 points| What is the total number of bits of the compressed message? What is the compression ratio c) ? Show vour computations Part B) Lempel-Ziv Compression Compress the following message using LZ-78. (You must show the compression table) BAABCAACCBAAABCA