$10-$ Given the following Huffman encoding table, decipher $($decode$)$ the bit strings

below $($part a$)$

a$.10100010010101000100011101000100011$ b$.$ How many bits would it take to represent the word from part a$)$ using ASCII

characters assuming that one would use $8$ bits per ASCII character?

c$.$ What is the compression ratio between parts a$.$ and b$.?$