Pen and paper Take the following string, generate Huffman codes for it (don't forget the spaces), and show how it would be encoded: apples and bananas If we assume that each character requires 7 bits to be encoded in ASCII, then what level of compression will be achieved by using Huffman encoding? (i.e. what percentage reduction in size does Huffman encoding achieve relative to ASCII?)