Based on these frequencies, you are required to implement the Huffman encoding $($see the lecture note for details$)$ to derive the binary code tree. From the binary code tree, generate the code for each letter.

$(5$ points$)$ Write an encoder that uses the generated code from Problem $1$ to encode

messages that are inputted by user.

Sample user input: DRACARYS

Sample coded message: $101110101111001110111011001101111100$

$(5$ points$)$ Write a decoder that uses the generated code from Problem $1$ to decode

coded messages.

Sample coded message: $01001101100110011100001001110$

Sample output: ILLBEBACK

Answer question $2$