Question(2 part Question) : (On Paper) Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, the lengths of the assigned codes are based on the frequencies of corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the largest code. Part-1: Write the Huffman code for each of the characters in this tree.

Part-2: Write Huffman Code for the following text:

Eerie eyes seen near lake.

Show complete step-wise working; otherwise, the solutions will not be accepted.