Problem
1. The letter "q" given in the text can be processed as a sequence of five-bit characters. Discuss the pros and cons of doing so in order to use a character-based run-length encoding method.
2. Show the construction process when the method used in the text is used to build the Huffman coding tree for the string "ABRACADABRA." How many bits does the encoded message require?
3. What is the Huffman code for a binary file? Give an example showing the maximum number of bits that could be used in a Huffman code for a N-character ternary (three-valued) file.