b) A discrete memoryless source has an alphabet of five symbols {A,B,C,D,E). A long message consisting of 3000 symbols has 25% of the symbols being A, 29% are B, 12% are C, 10% are D and 24% are E. i. Construct a Huffman code for this source that gives the maximum possible code efficiency [2 marks] ii. Calculate the source entropy, the average codeword length, and the code efficiency [3 marks)