Hand$-$written solution will be much appreciated Given the symbols and their frequencies of occurrence below:

a$)$ Construct and draw the Huffman Tree based on the symbols above and their frequencies of

occurrence weights.

b$)$ Write down the optimal prefix code for each symbol.

c$)$ Find the average bit length $($ABL$)$ of the prefix codes above. Show the steps of calculation.