In: Computer Science
Answer is last picture first three are explainations
Huffman tree construction process explaination
By merging two smallest frequencies each time until we get two nodes so that we assign them label 0 and 1 and then keep expanding these nodes until we get the all letters as nodes of tree
now construction of tree by expanding into nodes
now answer
If you are having any doubts please ask i will answer asap