Consider this Huffman Tree and select the statements that are true about it$,$ the text from which it was generated, and the encoding it produces:

image.png

Group of answer choices

B occurs more frequently than U but not as frequently as T

The two most frequently occuring characters are encoded using exactly two bits

$00011$ is a valid string code for this tree

The two least frequently occuring characters are encoded using exactly three bits

$00111$ is a valid string code for this tree

$01010$ encodes the string $"$TB$"$