Answer Must Be In C# Code. Show Proof The Program Runs In Console Window.

3.) Manipulate fasta DNA sequences with a linked list or array.

Generate 20 fasta DNA objects. Each contains an id (gi) number and a random sequence whose length is also random but are multiples of 3.

Create a linked list or array and use it to store the 20 fasta DNA objects. The linked list or array should be able to process the following functions:

Search for a fasta DNA object by the id number

Insert a fasta DNA object by given both the id number and the sequence

Delete a fasta DNA object by given an id number

Update a fasta DNA object when given an id and new sequence

Given a pattern, find the pattern in all DNA sequence and output (id, position) whenever it is found.

Using a standard codon translation table as follows to translate all the DNA sequences to protein sequences and output the result.

Translation table

{"ttt", 'F'}, {"tct", 'S'}, {"tat", 'Y'}, {"tgt", 'C'},

{"ttc", 'F'}, {"tcc", 'S'}, {"tac", 'Y'}, {"tgc", 'C'},

{"tta", 'L'}, {"tca", 'S'}, {"taa", '*'}, {"tga", '*'},

{"ttg", 'L'}, {"tcg", 'S'}, {"tag", '*'}, {"tgg", 'W'},

{"ctt", 'L'}, {"cct", 'P'}, {"cat", 'H'}, {"cgt", 'R'},

{"ctc", 'L'}, {"ccc", 'P'}, {"cac", 'H'}, {"cgc", 'R'},

{"cta", 'L'}, {"cca", 'P'}, {"caa", 'Q'}, {"cga", 'R'},

{"ctg", 'L'}, {"ccg", 'P'}, {"cag", 'Q'}, {"cgg", 'R'},

{"att", 'I'}, {"act", 'T'}, {"aat", 'N'}, {"agt", 'S'},

{"atc", 'I'}, {"acc", 'T'}, {"aac", 'N'}, {"agc", 'S'},

{"ata", 'I'}, {"aca", 'T'}, {"aaa", 'K'}, {"aga", 'R'},

{"atg", 'M'}, {"acg", 'T'}, {"aag", 'K'}, {"agg", 'R'},

{"gtt", 'V'}, {"gct", 'A'}, {"gat", 'D'}, {"ggt", 'G'},

{"gtc", 'V'}, {"gcc", 'A'}, {"gac", 'D'}, {"ggc", 'G'},

{"gta", 'V'}, {"gca", 'A'}, {"gaa", 'E'}, {"gga", 'G'},

{"gtg", 'V'}, {"gcg", 'A'}, {"gag", 'E'}, {"ggg", 'G'}