Q4. [70] Huffman Code 1. [30] Using Huffman Algorithm, construct an optimal binary prefix code for the letters in the given frequency table Letter Frequency 12 18 10 A. [10] Draw your Huffman Tree, and B. [15] Give an optimal binary prefix code for each letter C. [5 Give the total number of bits required to encode the string given in the frequency table 2. [20] Decode each bit string using the Huffiman code in 1 A. 011000101010100 B. 1000100001010100 D. 1000010011100 [20] Encode each word using the Huffman code in 1 A. RISE B. EXIT C. TEXT D. EXERCISE 3