1 (15 pts.) Under a Huffman encoding of n symbols with frequencies fi , f. . . . , f", prove or disprove (give a counterexample) the following two statements: (1) (9 pts If one character occurs with frequency more than 1/3, then there is guaranteed to be at least one codeword of length 1. (2) (6 pts) If allacters occur with frequency less than 1/7, then there is guaranted to be no codeword of length2