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

Time left $1$:$26$:

Which of the following inferences is NOT true?

Select one:

All of the other choices are true

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

Character $B$ and $D$ appear the most frequently in the message

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

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