Build the Huffman tree for the following quote $($note: include spaces$)$

$"$if you tell the truth you dont have to remember anything"

$($note: punctuation and capitalization removed deliberately$)$

Keep track of your in$-$order priority queue with the largest number to the left and the smallest to the right. When inserting, insert into the first position where a node is valid to insure you get the same tree as me $($for grading$).$

Build your Huffman table assuming left$=0,$ right$=1$

Encode the final value of the string

Hand in: Tree representation, Huffman table, final encoding