Alice needs to send a large message to Bob using only five words. Seeing that the message is too long she decides to compress the message using Huffman coding algorithm.
If the respective frequencies of words are given in the table, what would be the hamming code for w3 w1 w2 that she was supposed to use?
a 100011011
b 100011101
c 100001101
d 111011000