Question $3(2$ points$)$ Suppose the Huffman Tree code gives an average bit length of $3$ for the a nine character alphabet, say $"$a$,$ b$,$ c$,\%,\_,$ r$,$ w$,$ o$,$ z$"($ The characters are not important$).$ What is the compression ratio provided by this encoding scheme. $($ Hint: how many bits are needed to encode nine characters in a fixed$-$length encoding?$)$ Question $3$ options: $23\%30\%20\%25\%$