1. 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 (for each character)
3. Length of Huffman encoded message (in bits)

Characters	Frequencies
a	10
e	15
i	12
o	3
u	4
s	13
t	1

2. Try Huffman encoding to encode the strings (i) “go go gophers” and (ii) “happy hip hop”. Generate Huffman code for each character and the average code length.