2. Huffman Coding (25 pts, 10+10+5) Given the folloving set of chsracter- probablity (a) Build a Huffman tree for this character set. Fill in the following table to sthon sthe which will start with the leaf nodes for the symbok, and subtrees as they are built. Draw for each queue L. she queue T, which wif contain the w the tree shape for each subtree in T, Each row of the table must at the end of that step. (Start by filling in the queue L contents show the contents of the in the first line.) The last step should have a single tree (final Huffman tree) in the queue T values are broken arbitrarily, and it doesn't matter which dequeued node goes left and which goes right when building a subtree. Queue L Quene T Step SECOE I Enpty CO 2 2