$1.[3$ pts$]$: Consider the relative frequencies of the top $8$ letters in the English language: $\backslash (\{\}^\{1\}\backslash )$

$\backslash$begin$\{$tabular$\}\{|$l$|$l$|$l$|$l$|$l$|$l$|$l$|$l$|$l$|\}$

$\backslash$hline Letter & E & A & R & I & O & T & N & S $\backslash \backslash$

$\backslash$hline Freq. & $112$ & $85$ & $76$ & $75$ & $72$ & $70$ & $67$ & $57\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$

Calculate the Huffman code for these $8$ letters. Show your work in the format of used in the powerpoint slides for greedy algorithms $($that format came from the Mikipedia page on Huffman Coding$).$

Solution: