Consider a source which produces two kinds of messages, Y and N, with probability 1/4 and 3/4, respectively. (a) Compute the entropy of the source. There is only one optimal code, which assigns 0 to Y and 1 to N, or vice versa. The expected length of this code is 1. We can do better by encoding combinations of 3 messages. (Assume they are produced independently.) So consider messages YYY, YYN, YNY, ..., NNN. (b) What are the probabilities (c) Compute the entropy of these 8 messages (d) construct a Huffman code, (e) and compute the expected length for this Huffman code. (f) Is it better to send combinations of 3 messages? Justify your answer. Consider a source which produces two kinds of messages, Y and N, with probability 1/4 and 3/4, respectively. (a) Compute the entropy of the source. There is only one optimal code, which assigns 0 to Y and 1 to N, or vice versa. The expected length of this code is 1. We can do better by encoding combinations of 3 messages. (Assume they are produced independently.) So consider messages YYY, YYN, YNY, ..., NNN. (b) What are the probabilities (c) Compute the entropy of these 8 messages (d) construct a Huffman code, (e) and compute the expected length for this Huffman code. (f) Is it better to send combinations of 3 messages? Justify your