My Mother name is: Jasmin Akter

Huffman’s Tree:

Using Huffman tree to encode:

Jasmin Akter=100010011010101111001101111011110000001010011=45 bit

Using ASCII Encoding:

Here we can see that my mother name length is 10 character.we know that ASCII stores 8 bit per
character.so that we need (8*12)=96 bit for ASCII encoding.

Calculating Bit Difference

So the bit difference between Huffman’s tree encoding and ASCII encoding is (96-45)bit=51 Bit