A file contains the following characters with the frequencies as shown. If Huffman Coding is used for data compression, determine: 1. Huffman Code for each character 2. Average code length 3. Length of Huffman encoded message (in bits) Characters Frequencies a e i 0 u S t 10 15 12 3 4 13 a. First let us construct the Huffman Tree and assign weight to all the edges of the constructed Huffman Tree. b. To write Huffman Code for any character, traverse the Huffman Tree from root node to the leaf node of that character.