Answer Happy

A Huffman tree is given below. Each node has a letter and a frequency, e.g., (E:3), which means that the letter "E" has frequency 3, or just a frequency when it is a non-leaf node. 75 28 47 D:13 15 M:8 22 10 W:25 U:12 E:3 L:4 N:5 0:5 According to Huffman's algorithm, in each iteration, two nodes are dequeued from the priority queue and combined into a new parent node having them as two children and with frequency equal to the sum of their frequencies. In the first iteration, (E:3) and (L:4) are combined into a new node with frequency 7 = 3+4. Give your correct answer for each question (no space in front, between, or after, and no quotation marks). a) In the third and the forth iterations the new parent nodes have frequencies and , respectively. b) The Huffman code for the letter "E" is c) The sequence 1101000101010100100110000100 is decoded to