Problem $2.$

Determine an optimal Huffman code $($using binary strings$)$ for a file $\backslash ($ F $\backslash )$ containing a set of characters with the following frequencies:

$7$ points

a$)$ Draw a Huffman tree based on the above frequencies. Show only the final tree.

$3$ points

b$)$ Show the Huffman code of each character, based on the Huffman tree above.