Following are the codes generated from a text for a Huffman tree construction.

You are also given the following information:

The frequency of each leaf node except $e,l,$ and $t$ is $1.$

The left and right child nodes of the root have frequencies $5$ and $8$ respectively.

Now answer the following questions.

CO$2$ a$)$ Suppose in a Huffiman tree, the distances from the root to the pair of leaves denoting the

letters $k$ and $b$ are $5$ and $2$ respectively, which letter between them is more frequent in the

original text? Just mention the letter.

b$)$ Draw the Huffiman tree from the given coding table above.

c$)$ Continuing on $Q(b),$ what are the frequencies of $l,$ and $t$ in the original text? Just mention

the frequencies.

Your lazy friend, Tom, used a very simple encoding method for compressing a text file. The text

file contains the string : Sudden Hello. He used a constant number of bits for encoding each of the

$n$ distinct characters in this text. The constant is ceill $(lo{g}_{2}n)$ in this case. On the other hand, you

have compressed the text file using your own huffiman tree from $Q(b).$

d$)$ Mention how many bits each of the characters in Tom's encoding scheme contain.

e$)$ Compare between the number of bits needed to decode the above$-$mentioned string using

your friend's scheme and your Huffiman tree from Q$($b$).$

handwritten answer only