0 0 0 (b) Huffman coding is an efficient means of coding a message so that it occupies the smallest number of average bits/symbol. A message of length x symbols is made from a set of 8 symbols drawn from a vocabulary shown below, with each symbol being coded using 3 binary bits: Symbol 3-bit coding Relative element frequency A 0.18 B 0 0 1 0.1 0.05 1 0.05 E 0.4 0.06 0.04 0.12 0 1 0 D 0 1 0 1 0 F 1 0 1 G 1 0 1 1 H 1 1 7 So the message HEDGE (* = 5) would be coded as 111,100,011,110,100. This message requires a constant 3 bits/symbol. Analysis shows that in general usage, the symbols appear with the relative frequency as shown also in the table. (0) Construct a Huffman coding tree to determine the most efficient alternative coding for the symbols so as to minimise the number of bits/symbol to code a message. [10 marks) () Determine the average number of bits/symbol required to code a message using this more efficient alternative coding. [5 marks]