DRAW THE TREE USING A PAPER

2. [10 points] Huffman encoding a) (6 pts) Construct the Huffman tree and show the encoding of each letter based on the frequencies below: b) ( 4 pts) If you must encode a file consisting of 106 characters, how much space would the Huffiman encoding require? What about the fixed size encoding