b$)[$CO$1]$ You are given the following tree generated by simulating the Huffman encoding algorithm

on a text message.

i$)$ Write the encoding for each of the characters. Consider left to be $0,$ and right to be $1$ when

traversing the tree.

ii$)$ Decode the following encoded message using the character codes you wrote on question $($i$).$

$01001001111011110000101111011000101101100010111101110100110110001111000101$

handwritten ans only