4. Let us suppose that a file F has an alphabet of a, b, c, d, e, f, g, h with counts based on the Fibonacci sequence: letter a bc d ef g h count inF1 1 2 3 5 8 13 21 (i) Construct the Huffman tree for this file. (ii) Suppose that a file G has an alphabet of n characters with counts the first n Fibonacci numbers Generalize your previous answer and construct a Huffman tree for the file G 4. Let us suppose that a file F has an alphabet of a, b, c, d, e, f, g, h with counts based on the Fibonacci sequence: letter a bc d ef g h count inF1 1 2 3 5 8 13 21 (i) Construct the Huffman tree for this file. (ii) Suppose that a file G has an alphabet of n characters with counts the first n Fibonacci numbers Generalize your previous answer and construct a Huffman tree for the file G