Huffman coding

[KayS]

I appreciate that there may be some visually impaired users. But, this question has diagrams and I found no possible way to display the question. Therefore, I have given a link to the question so I don't offend anyone and whoever can help me go through the question I would appreciate it if you could have a look at the question.

http://tinypic.com/r/2livns7/8(I have also attached the file, sorry but I just couldnt draw the diagrams but any quesiton that can b written i will.)

The question is regarding Huffman coding, The answer I chose Was A because according to huffman coding you have to sort the frequency by lowest to highest and then take the two lowest out as leaves at the bottom of the tree and start with the highest frequency at top, the one that resembles this description is A, as H & N have the lowest in frequency.

Please let me know what you think.

[hardkey]

Intuitively, it's A.

Because of the reason you gave, which is to say that the other three trees include non-minimal code.