Problem $9.$ Consider a message that uses the following letters with frequencies based on their occurrence in

English:

E T A O I

$2216151413$

You should

$$ Specify the intermediate trees$/$forest constructed at each stage of Huffman$$s algorithm. You may specify

your trees either by drawing them by hand & including the images, using a LaTeX package such as TikZ, or

with nested parentheses.$$

$$ Specify the encoding of each of the five letters