$[1$ point$]$Huffman::ascii$\_$decompress$\_$body$()$: This function should read one "bit" $($a $\text{'}0\text{'}$ or $\text{'}1\text{'}$ char$)$ at a time from the input stream until a legal code is assembled, then write the corresponding decoded character to the output stream, and repeat until reaching the end of file

$[2$ points$]$Huffman::build$\_$optimal$\_$trie$()$: This function should create a forest of one$-$node tries $($aka$$trie$\_$pq$)$ representing the characters in the input file and their frequencies, then repeatedly combine the two smallest tries until only one is left according to the following instructions:

$1.$ Remove trie in$$trie$\_$pq$$with SMALLEST frequency, assign to$$first$,$ remove trie in PQ with NEXT SMALLEST frequency, assign to$$second$2.$ Create new$$TrieNode$$and make$$first$$and$$second$$its left and right children, respectively. Set new node's frequency to the sum of$$first$$and$$second$\text{'}$s frequencies, and then put the whole thing back into the priority queue

$[2$ points$]$Huffman::compute$\_$all$\_$codes$\_$from$\_$trie$()$: The function should recursively traverse the trie rooted at$$T$$to determine the$$huffcode$$string at every leaf and initialize$$compression$\_$map$$and$$decompression$\_$map$$with this information