When a Huffman tree is used, the string in Figure 1 can be represented using 138 bits.
ARTIFICIAL INTELLIGENCE ALGORITHM
The 33-character string shown in Figure 1 could also be encoded using standard 8-bit ASCII.
How many bits are saved when Huffman coding is used rather than ASCII to represent the string shown in Figure 1?
You must show your working.