Question 11: Consider the following text message between the double quotes: "aba bbaab bacbccbbb a cbbccb aaabaa aba bo" 1. Build a Huffman coding tree that can be used to encode this message. 2. Show each symbol and its Huffman code representation. 3. Show the code for the transmitted Huffman coding tree, replacing the ASCII code of each character with the character itself. 4. Show the Huffman code for the following last portion of the message: "aba bc". 5. Assuming that an uncompressed form of the text message will use one byte per letter, compute the compression ratio of the message.