The following five characters $A,B,C,D,E$ form a set of characters to be encoded using the Huffman compression technique. Which of these represents is NOT a possible set of Huffman encodings?

Select one:

None of the others $($insufficient information provided$)$

$A=111,B=010,C=011,D=100,E=101$

$A=10,B=11,C=011,D=010,E=000$

$A=1,B=001,C=000,D=100,E=001$

$A=1,B=001,C=0110,D=0101,E=0111$