I would like to know if someone know the step by step process for this problem. Any help will be appreciated For the following letter frequency table, a Huffman Code was constructed as shownbelow. The associated tree is also shown below.LetterLD4242110 101FrequencyHuffman CodeE12010(30679101186U371004210107C321110M2411111K7111101Z2111100图园(a) Is there another code and a free possible? What is (are) the difference(s)?(b) Compute the redundancy = Average Codeword Length (Lav) - Entropy (H(x)).The entropy H(x) is calculated from H(x) = -Ei=1 Pilogpi.(c) Check if this redundancy is less than p₁ + 0.086, where p₁ is the probability ofthe most common symbol.(d) Also, check if the following inequality is satisfied:H(x) ≤ Lav ≤H (x) + 1.Repeat parts (b), (c), (d) for a different tree you built. What conclusions can youdrawe

Here we have given step by step solution for the given tasks. You can find the solution in step 2.

For the following letter frequency table, a Huffman Code was constructed as shown below. The associated tree is also shown below. Letter L 42 110 Frequency Huffman Code E 120 1 0 306 D 42 101 79 1 0 1 (186 U 37 100 1 0 107 0 C 32 1110 65 M 24 11111 K 7 111101 Z 2 111100 (a) Is there another code and a tree possible? What is (are) the difference(s)? (b) Compute the redundancy= Average Codeword Length (Lav) - Entropy (H(x)). The entropy H(x) is calculated from H(x) = -=1 Pilogpi- (c) Check if this redundancy is less than p₁ +0.086, where p₁ is the probability of the most common symbol. (d) Also, check if the following inequality is satisfied: H(x) ≤ Lav ≤ H(x) + 1. Repeat parts (b), (c), (d) for a different tree you built. What conclusions can you