You are given the following text file containing letters $A,B,C,D,$ and $E.$

ABBEACDDCDEEAADABDBEABDAD

i$.$ Construct an optimal prefix code called Huffman code for the above file $($see Appendix for the algorithm$).$ Show the steps of your solution. right $[z]larrylarr$ EXTRACT$-$MAX $(Q)$

Redraw only the optimal cost tree for the modified algorithm.

Jwo porsible sodutions

$5$