Build a Huffman Tree using the data below. At each split, you should assign $0$ to the subtree with the lower total frequency $($and make it the left child$)$ and $1$ to the other subtree $($and make it the right child$).$

Each line contains one $($character$,$ frequency$)$ tuple: