Consider a discrete memoryless information source modelled by a random variable X having four possible alphabets (a, b, c, d) with probabilities: Pr (X = a) = 0.2 Pr (X= b) = 0.35 Pr (X = c) = 0.4 Pr (X = d) = 0.05 You are asked to perform Huffman coding algorithm to encode one message at a time. Answer the following questions: (a) Find a valid encoding table of the Huffman code for this information source. That is to say, you need to present the codeword for each alphabet. L- (b) What is the expected codeword length of this code? SELA