Problem 4. Huffman code. The letters A text file consists of characters a, b, c, d, e, and f appearing 15, 10, 13, 3, 18, and 41 times, respectively. Find a Huffman tree for this file. Show codewords for each symbol. What is the size of the compressed file (using Huffman coding)?