which of the following inferences is not true? the longest root to leaf path in the huffman tree from which the code is derrived 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. All of the other choices are true. The message contains characters A$,$ E$,$ L$,$ O$,$ R$,$ B$,$ D only