Problem $4.$ Let's say that we have a file with the following characters and frequencies.

$($a$)$ Using Huffman's Algorithm, determine an optimal prefix code for the file. Draw what the binary tree looks like.

$($b$)$ Calculate the number of bits needed to encode the file using the optimal prefix code you discovered in part $($a$).$

Look at the picture for better reference.