Using Huffman tree in the Expression and Huffman Trees presentation, decode the following binary string using Huffman tree in the Expression and Huffman Trees presentation.

Use alternate colors to represent the individual letters and corresponding sub-string, separate sub-string by a blank space. You can do it by hand, scan and upload.

For example,

100010 1001 010

g o e

1100010001010001001011101100011111110001101010111101101001