i just need question 10 please

8. Which of the following inferences is NOT true? A. The message contains characters A, E, L, O, R, B, D only B. Character B and D appear the most frequently in the message C. The longest root-to-leaf path in the Huffman tree from which the code is derived has a lengths D. The Hulfman tree from which the code is derived has seven leaf nodes E. all of the above are true 9. Given a code 101111011011111101 , which of the following was the original (decoded) text? A. DOORRL B. OODREB C. DOORRE D. DOROERL E. insufficient information given 10. For a word REALDEAR, what is the resulting compression ratio if we encode it using the siven Huffman code, instead of using exterided ASCI? A. 8/64 B. 8/32 C. 21/64 D. 43/64 E. 21/56 F. insufficient information given