Consider the below forest generated after the first two iterations of Huffman's tree$-$construction algorithm. The number in each node is the character frequency.

QUESTION $1$: The missing number $($marked by the question mark$)$ is

Choices: $8,12,3,4,1$

QUESTION $2$: What would be a valid codeword for a in any of the resulting Huffman tries? $($Hint: Consider the length of the codeword rather than the actual value. The codeword value may differ based on the tree combination order and edge labeling.$)$

Choices: $00110,11,0,111$

QUESTION $3$: How many bits are needed to store a resulting trie into a file, assuming that extended ASCII is used to encode each character?

Choices:

$7$ bits because there are $7$ characters

$58$ bits because there are $58$ characters

$13$ bits because the tree has $13$ nodes

$63$ bits

$56$ bits because there are $7$ characters

$124$ bits

$69$ bits