Digital comm.

QUESTION 3 (2 x 5 = 10 POINTS) A memoryless discrete source produces symbols with the probabilities p(x1) = 0.40, p(x2) 0.20, p(x3) = 0.15, p(24) = 0.15, p(x5) = 0.10, a) Create a Huffman code for this source. b) Determine the entropy and the expected codeword length for the code. Is it possible to transmit this source reliably at a rate 2.1 bits per source symbol? Why? QUESTION 3 (2 x 5 = 10 POINTS) A memoryless discrete source produces symbols with the probabilities p(x1) = 0.40, p(x2) 0.20, p(x3) = 0.15, p(24) = 0.15, p(x5) = 0.10, a) Create a Huffman code for this source. b) Determine the entropy and the expected codeword length for the code. Is it possible to transmit this source reliably at a rate 2.1 bits per source symbol? Why