Question 8. (5 points) In Huffman coding, suppose that the alphabet consists of 256 symbols denoted by so, s1,... , s255. Let fi denote the frequency of symbol si, 0 fi++f25s then the code for every si has length 1i 4. If for everyi e (0,1,,254) we have fi >fi+i+f2ss then the code for every si has length 1+log2(i 1) Choose one of the following about the above statements: 1. Statements 1 and 3 are true, statements 2 and 4 are false 2. Statements 1 and 4 are true, statements 2 and 3 are false 3. Statements 2 and 3 are true, statements 1 and 4 are false Statements 2 and 4 are true, statements 1 and 3 are false 5. All the statements are false