43, For an input symbol set of n symbols, exactly how many internal nodes in the encoding tree does Huffman's algorithm create? Under Huffman's algorithm, what is the exact worst-case length of the longest codeword for | 44. n input symbols? 45. True or false: the set of codewords (00,010,011, 10,01) is a valid output of Huffnan's algorithm. 46. True or false: the set of codewords 110,0, 100, 101 is a valid output of Huffman's algorithm. 47. True or false: the set of codewords 01, 11, 100, 101) is a valid output of Huffman's algorithm 48. For {a,b,c), give the set of inequalities on the frequencies fa,fe,fe that would yield corresponding codewords of 0, 10, 1 uder Huffman's algorithm. 49. Suppose a message is composed of the following letters and corresponding frequencies: How many bits does Huffman's algorithm (A 6). (L 1), G: 4), (O 5), (S 2) use to encode the symbol G