1. In an alphabet with 20 symbols, what is the number of leaves in a Huffman tree?
2. Is the following code an instantaneous one? Explain
00 01 10 11 001 011 111
3. Assume a message is made of four characters (A, B, C, and D) with equal probability of occurrence. Guess what the encoding Huffman table for this message would be. Does encoding here really decrease the number of bits to be sent?