For the same text as 1(a), by building the Huffman tree determine the compression ratio and saved space (as a percentage of the original file size) when the Huffman compression is used to compress the text. Again you can assume that each character in the source file occupies 8 bits. Explain your reasoning. You do not need to draw the tree, just explain the structure of the tree.

Note: Marks will be lost if the Huffman tree is not used, your computation involves building the compressed file to find its size or includes any unnecessary work.

[5]