Consider a complete Huffman table shown below, generated for some message,

$\backslash$table$[[$Huffman Chde,Character$],[00,$A$],[01,$E$],[100,$L$],[110,$O$],[111,$R$],[1010,$B$],[1011,$D$]]$

Which of the following inferences is true?

Select one:

The Huffman tree from which the code is derived has two root nodes

The longest root$-$to$-$leaf path in the Huffman tree from which the code is derived has a length of $7$

The message contained up to $10$ unique characters

Characters A and $E$ appear most frequently in the message

We can derive the message's compression ratio from only the given information