QUESTION $1$

$(6$ marks$)$ Given the Huffman code tree below:

a$.(3$ marks$)$ Decode the following bit string using the above Huffman code tree.

$10010011100001$

b$.(3$ marks$)$ Encode the word SECURES using the above Huffman code tree