Problem 2. Consider the following symbols with their corresponding frequencies: A : 1, B : 1, C : 2, D : 3, E : 5, F : 8, G : 13, H : 21

Problem 2.a. Construct the Huffman coding of these symbols along with its optimal coding tree.

Problem 2.b. Use your coding tree to decode 0001001000010000000001001

NOTE:

please follow this:

- alphabetical order left to right. For example, for A and B, A becomes the left child and B becomes the right child. Then C will sit as a right child and so forth.

- Labeling: left child 0, right child 1