(a) Shanon-Fano and Huffman Encoding are two types of entropy encoding compression methods. State the difference between these two types of encoding. [2 marks] (b) Table Q1(b) shows the probability distribution of total 1000 character of ASCII symbols; A, B, C, D, E, F, $. Analyze the probability and generate the codeword for encoding and decoding process by using any of entropy coding compression method. (Please provide a suitable illustration based on the chosen method.) Table Q16) Symbol Probability 0.25 0.1 0.15 0.05 0.05 [10 marks) (c) Based on the answer in Q1(b), illustrate the process of encoding and decoding of a string CAEE$ on the transmitter and the receiver end. [5 marks) (d) Calculate the compression ratio of the compression process in Q1(e) [3 marks]