Let us say we use Huffman's algorithm to obtain the encoding \{0, 10, 11\} of the alphabet \{a, b, c\} with frequencies $f_a, f_b, f_c$. Among the choices below, which of the following could be an example of frequencies $(f_a, f_b, f_c)$ that would produce the given encoding?
33, 33, 34
34, 33, 33
25, 30, 45
45, 30, 25