Huffman tree

Hi

Please find correct answer and explain.

Question:  


Consider the Huffman tree where the character frequencies are: Freq(A)=16, Freq(B)=8; Freq(C)=4;Freq(D)=2;Freq(E)=1;Freq(F)=1.   The total length of the encoding with the above frequencies and the derived Huffman tree is:

Answers:

a)  62
b)  63
c)  64
d)  30
e)  31

Thanks

Annie