Question Three (20 Marks) a. Huffman coding assigns codes to characters such that the length of the code depends on the relative frequency or weight of the corresponding character. Thus, it is a variable-length code. If the estimated frequencies for letters match the actual frequency found in an encoded message, then the length of that message will typically be less than if a fixed-length code had been used. Due to such advantages, RadiantRay Networking Sdn Bhd uses Huffman compression technique to encode the message before transmitting over the network to its customer. Suppose the message contains the following characters and their respective frequencies as shown in Table Q3a Table Q3a Letter C D E K L M U Z Frequency 32 42 120 742 24 37 2 1. How many bits may be required for encoding the message without using Huffman coding? (1 marks) ii. Create an Huffman table indicating the number of bit of characters, frequencies and the code used in transmission of the message (3 marks) ili. What is the total size of the massage to be sent? (1 mark) iv. Construct the Huffman encoding tree (3 marks) V. What is the size of the table for encoding the message? (1 mark) vi. With Huffman Coding compression technique, what is the percentage of bits saved? (1 marks) vii. Using the code generated by Huffman tree Q3a(iii). What is the string bit for the word "DEED" and "MUCK