Your task is to create a Python program that reads DNA sequences from an input file $($below is a file example illustrating how the data is organized$)$ and generates the consensus sequence. Additionally, an output file will be created that stores the nucleotide frequencies for each position, so as to help determine whether the consensus is indeed an accurate representation of the sequences.

B$.$ DESCRIPTION:

Basic Algorithm: Here is the basic algorithm:

Load data from the input file into appropriate data structures

Count the nucleotide frequencies for all positions in all positions

Determine the consensus

Process results

Print consensus string to the screen

Write consensus string to output file

Write to output file frequencies of each nucleotide for each column

C$.$ TECHNICAL REQUIREMENTS AND DATA DESCRIPTION:

Input file: DNA strings to be processed are to be read from a file named DNAInput.txt$.$ The files have the following format: Description line, sequence line, description line, sequence line, and so on$.$ Here$$s a sample file:

$>$biological$\_$description$\_1$

GATCAGCTAG

$>$biological$\_$description$\_2$

AATCCGATCG

$>$biological$\_$description$\_3$

AATGCGCTAG

$>$biological$\_$description$\_4$

ACTCTGCGTG

$...$ and so on $...$

Description lines always start with the $>$ character; you may disregard these lines.

Note: These files are usually a FASTA file, but FASTA files can be read as plain text files, except that the file extension is either $.$fa or $.$fasta.

$($i$.$e$.$ read the file in the same way you would read a $.$txt file$)$

Output file: You will store the consensus sequence and the frequencies of the nucleotides in a file called DNAOutput.txt$.$ For the sample input file provided above, here$$s what the output file would contain:

Consensus: AATCCGCTAG

Pos $1$: A:$3$ G:$1$ C:$0$ T:$0$

Pos $2$: A:$3$ C:$1$ G:$0$ T:$0$

Pos $3$: T:$4$ A:$0$ C:$0$ G:$0$

Pos $4$: C:$3$ G:$1$ A:$0$ T:$0$

Pos $5$: C:$2$ A:$1$ T:$1$ G:$0$

Pos $6$: G:$4$ A:$0$ C:$0$ T:$0$

Pos $7$: C:$3$ A:$1$ G:$0$ T:$0$

Pos $8$: T:$3$ G:$1$ A:$0$ C:$0$

Pos $9$: A:$2$ C:$1$ T:$1$ G:$0$

Pos $10$: G:$4$ A:$0$ C:$0$ T:$0$

Note that the nucleotide sequences listed for each column are in non$-$increasing order by frequency. In case of a tie $($when $2$ different nucleotides have the same frequency$)$ it doesn$$t matter which one comes first in the output. For example, the last line in the previous example could have also been:

Pos $10$: G:$4$ C:$0$ T:$0$ A:$0$

You may assume that:

$$ Every combination of description$+$sequence takes up $2$ lines $(1$ line for each$).$

$$ All sequences in the file have the same length. The exact length is not initially known; you may determine it from any of the sequences.

$$ All nucleotides are in capital letters.

$$ There will be no characters other than A$,$ C$,$ T$,$ and G in the sequences.

$$ There will be no ties for the most highly$-$occurring nucleotide in any column. This means that, when determining the consensus, there will be a single nucleotide that is the highest occuring.

You may NOT assume that:

$$ The length of the DNA sequences will be $10,$ as in the example.

$$ The amount of DNA sequences will be $4,$ as in the example.

Your code:

$1.$ Create a function called load$\_$data.

a$.$ It takes as argument the name of the file to be used $($a string$).$

b$.$ It returns a data structure $($or more than one$)$ that contains all of the information from the input file.

$2.$ Create a function called count$\_$nucl$\_$freq.

a$.$ It takes as argument the data structure$($s$)$ generated by load$\_$data.

b$.$ It returns a new data structure $($or more than one$)$ that contains the frequencies of the nucleotides for each column in each sequence.

$3.$ Create a function called find$\_$consensus.

a$.$ It takes as argument the data structure$($s$)$ generated by count$\_$nucl$\_$freq.

b$.$ It returns a string; the consensus sequence.

$4.$ Create a function named process$\_$results.

a$.$ It takes as arguments the data structure$($s$)$ created by count$\_$nucl$\_$freq and the name of the output file $($a string$).$

b$.$ It writes the results, in the format previously described, to the output file.

c$.$ It doesn$$t return anything.

Other Important information

$1.$ Sample files are provided, but they are for testing purposes only. In other words, the sample DNAOutput.txt provided should be the result of executing your program with the sample file provided $($DNAInput$.$fasta or DNAInput.txt$).$ Your program should be able to work with any FASTA file where all sequences are of the same length.

$2.$ You should NOT prompt for the file name; you should ALWAYS try to open a file named DNAInput.txt and your output should ALWAYS be to a file named DNAOutput.txt$.$