Given the letters and frequencies below, draw the Huffman tree and write the Huffman code for each letter. At each step of the Huffman algorithm, always connect the smallest frequency node as the left child and the second smallest frequency node as the right child. After finding the code for each letter, decode the message:

$001011110110101000011011111011110$

$\mathrm{<img\; src="https://dsd5zvtm8ll6.cloudfront.net/questions/2024/02/65c655ed46489\_1707496938182.jpg"\; style="display:\; block;\; vertical-align:\; top;\; margin:\; 5px\; auto;\; text-align:\; center;"\; width="300"\; height="377"\; alt="Letter\; A\; BCDEF\; XOHI\; K\; L\; M\; Freq\; 2\; 346\; 7\; 8"> }$

 

Letter A BCDEF XOHI K L M Freq 2 346 7 8 10 11 12 14 15 16 Code