Quiz Huffman Greedy Algorithm

I am not able to understand the problem problem please help me.

Post the message to be encoded so that we can know the frequencies of the characters and calculate the huffman codes for each character.

For aabbbbabccdddccccbbdd
The frequency of:
a:3
b: 7
c: 6
d: 5

on calculating the huffman codes using the huffman tree
you’ll get codes for:
a: 00
b: 11
c: 10
d: 01

so the decoded message for 110100 would be
bda