The string shown in Figure 1 can be encoded using Huffman coding or ASCII. ASCII uses 7 bits to represent each character.

Figure 1

MISSISSIPPI

Figure 2 shows the Huffman tree created for this string.

Draw on this

How many bits are saved by using Huffman coding rather than ASCII to represent the string in Figure 1?

You must show your working.