Question 8. (5 points) In Huffman coding, suppose that the alphabet consists of 256 symbols denoted by so, 81,..., s255. Let fi denote the frequency of symbol si, 0 fi+1 + + f255 then the code for every si has length 1 i 4. If for every i {0, i, . . . , 254) we have fi fi+1 + + f255 then the code for every Si has length 1 + log| +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 4. Statements 2 and 4 are true, statements 1 and 3 are false 5. All the statements are false