(a) Compute the source entropy for the following message.

FINAL_EXAM

(b) Obtain Huffman code for the above message.

(c) Is the code you obtain unique? Explain.

(d) Compute the average code length (b).

(e) Compute the coding efficiency for the code in (b).

(f) Describe the following, with the help of examples:

(a) Prefix codes

(b) Kraft-McMillan inequality

(c) Uniquely decodable