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

Which of the following inferences is NOT true?

Question $10$ Select one:

The message contains characters A$,$ E$,$ L$,$ O$,$ R$,$ B$,$ D only

All of the other choices are true

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

Character B and D appear the most frequently in the message

The Huffman tree from which the code is derived has seven leaf nodes