Greedy algo quiz - Huffman 2

Q1. Huffman 2
Consider the following message: aabbbbabccdddccccbbdd
If Huffman tree is coded as left child with ‘0’ and right child with ‘1’ from every node then what is the decoded message for 110100?

abc

bcd

acb

bda


shouldn’t the ANSWER BE “CBA” which is not in the option.