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: (+, 16) (O, 23) (A, 30) (C, 40) (E, 41) (S, 44) (N, 52) (R. 68) (T, 75) (H, 82) (1, 87) What is the output of a level-order traversal of the resulting Huffman Tree? Order them such that the top item is the first node to be visited, and the bottom item is the last node to be visited.