Question $4$

a$)$ Construct a Huffman code for the following data:

b$)$ Encode the text ABACABAD using the code of question a$)$

c$)$ Decode the text whose encoding is $1000101110010100$ in the code of

question a$.($depends on the way you have implemented the coding tree$)$

d$)$ find the average # of bits per character

e$.$ Compare with minimum fixed length encoding.