Use the knowledge of Python3, follow the instructions in the question, and solve the problem.

5. (1 pt) Using the Huffman Tree for the Hawaiian alphabet given in our course slides: ing the Huffman Tree (it means a Hawaiian way of fishing) (b) We saw in class that we can use a fixed-width encoding of 4 bits per character for the 13 Hawaian characters. If the word above were encoded using a fixed-width encoding of 4 bits per letter, would the code be longer or shorter, and by how many bits? The fixed-width encoding would be by bits (longer/shorter) 5. (1 pt) Using the Huffman Tree for the Hawaiian alphabet given in our course slides: ing the Huffman Tree (it means a Hawaiian way of fishing) (b) We saw in class that we can use a fixed-width encoding of 4 bits per character for the 13 Hawaian characters. If the word above were encoded using a fixed-width encoding of 4 bits per letter, would the code be longer or shorter, and by how many bits? The fixed-width encoding would be by bits (longer/shorter)