Consider a list of symbols S=A,B,C,D,E,F,G,H with frequencies 1,1,2,3,5,8,13,21. 1- Draw an optimal Huffman tree for S. ( 3 marks ) 2- Assign a codeword to each symbol using the tree made previously. (3 marks) 3- What is the compression rate? ( 2 marks) 4- Consider the general case where the frequencies are {Fn=Fn1+Fn2F0=F1=1}. What is the expected depth of the resulting tree in terms of n ? ( 2 marks)