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:

$$ occurs with the lowest freeqency in the text

$00011$ is a valid string code for this tree

$100100$ encodes the string $"22"$

$G$ and $M$ occur with the same frequency but $M$ is encoded using fewer bits than $G$

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

$V$ occurs more frequently than $R$ but less frequently than $M$