In this assignment, you will write a Python program that reads in a DNA sequence from a file, calculates the frequency of each nucleotide, uses Huffman coding to assign binary codes to each nucleotide, and then encodes the DNA sequence using the Huffman codes. This assignment will allow you to practice implementing a compression algorithm and demonstrate the usefulness of Huffman coding in bioinformatics applications. Your program should perform the following steps: 1. Write a Python function that reads the provided file dna.txt. The file contains a sequence of 510 nucleotides (C, T, G, A). and returns the frequency of each letter in the file. 2. Write a Python function that implements the Huffman coding algorithm to assign unique binary codes to each letter based on their frequency. 3. Write a Python function that encodes the entire file using the binary codes assigned to each letter. Write the compressed sequence to a file called compressed.txt. Your program should be organized into functions that perform each of the above steps. You should also include comments in your code to explain what each function does and any assumptions you made. Note: You may use any external libraries or packages that are available in Python. However, you must provide clear documentation for any external libraries or packages used. Your submission should include the following files: (5 points) compressed. txt: the compressed DNA sequence produced by your program. (30 points) huffman.py: your Python program that implements the Huffman coding algorithm. (65 points) Pdf file to answer the following questions: a. (5 points) If you used fixed-length code to encode the message, how many bits do you need per character? b. (10 points) If you used fixed-length code to encode the message, how many bits do you need to encode this message? Based on the results from the Huffman coding, answer the following questions: c. (10 points) What are the codes for each character after using Huffman coding? d. (10 points) What is the average number of bits per character after using Huffman coding? Show your work. e. (10 points) how many bits do you need to encode this message? Show your work. f. (20 points) Create Huffman encoding tree for these four characters. Show your work.