Question 4 DNA cas be represinted as a bong srepaesce of medectides. A tuicleotide is symboliard by obe of foar leters: A, C, G of T. The sise of DNA date can pet very large, wo it a very imporiant co efficketity store them. One of the wnys this can be dote is by asing compermion. Provided is a simple algorithm that describes how to cotnpress a DNA sequence. For this algorithm. as resoding table is used, where you tan look up the encoding of a rpecific sequence. The algorithm weiss on an input sequence P as follows: 1. Initialise the encoling tabk with ench of the fout letters: A,C,G and T and their encodingo (1,2,3,4) 2. Starting from the begisning of P, find the longest scquence of ktters S that match senething in the encoding table 3. Output the encoding of this sequence 4. Remove S froen the beginning of P 5. Add S plus the next letter in the imput to the escoding table. The encoding of this new sequence will be the escoding of the last sequence +1 6. Go to step 2 while there are still letters left in the inpat. For example, the sequence ATAA.AT would resalt in the compressed verion: 14175 The initisl encoding table looks like this: The final escoding table for the sequence ATA A AAT looks like this: Question Given is the following sequence: CGCCCCCCCGAGCCCCCT What is the encoding table once the compression is done? What is the compressed sequence? Compressed sequence: .................... Note: the number of rows provided to you for the encoding table is more than you should need