Question $3$: What would be the optimal Huffman code for the following set of frequencies, derived from the first $8$ Fibonacci numbers?

$\backslash$table$[[$character$,$frequency,Huffman code$],[$A$,1,],[$B$,1,],[$C$,2,],[$D$,3,],[$E$,5,],[$F$,8,],[$G$,13,],[$H$,21,]]$

Please

draw the Huffman trees $($the final tree, not the step$-$by$-$step construction of the Huffman tree$)(4$ points$)$

fill the Huffman code in the table $(2$ points$)$