How many bits are required to represent this text using the extended 8−$8-$bit ASCII character set?

b.$.$ How many bits after it has been encoded using the table above?

c.$.$ What is the compression ratio for this example?

d.$.$ Is data compressed using Huffman code resilient to data errors? Why? Try decoding

0010110111011011.$0010110111011011.$ This is the original bit string with the first flipped from 1$1$ to 0.$0.$