Consider a text with source alphabet $=\{$F$,$ L$,$ O$,$ S$,$ T$\}$ and frequency counts $($F: $1,$ L: $1,$ O: $4,$ S: $2,\backslash$Tau : $2).$ Form the Huffman code associated with this text and use it to decode the following message:

$1100001011110001101111$

sts @

Write the message below using all capital letters and no spaces or additional characters in your response.

Note. Recall that we use the following conventions in building the Huffman tree from frequency counts$/$weights:

The smaller weight child is always the left child of its parent.

ourse

$$ Whenever considering multiple nodes of the same weight, always break ties according to the node containing the alphabetically first letter. This tie$-$breaking rule applies both to choosing which is the left child of the parent and which pair of nodes is merged in the tree building procedure.