The Problem Scientists measure how closely related a species is by looking at the DNA sequences for key proteins and seeing how similanidissimilar they are. If the two sequences of DNA are essentially the same, the two species are considered to be evolutionarily closer since there is a relatioaship between changes and time. This process is called sequence alignment Consider the two strings of DNA below (completely made up, miss matches in red) Species 1: AATAACGAAA Do NOT use List!! Program Specifications: 1. You will read two strings at a time (one string on each line) and do scering operation. The strings can have any characters you like, but to be-biological" it should consist of: "A", ?.?,'G-but it is not the requirement Scoring. You will report the number of matches and the number of mismatches Interactively read a file name which contains the DNA sequences to be matched(scored). Assume that each pair of strings are same length and it could be in upper andlor lower case After you score: Print match count and mismatch count You print both strings Matching characters are printed in lower case. If the string was in upper case letters, you convert them to lower case on a match i. ii. All mismatches are printed in upper case. Assignment Notes: . As before, try to do this in pieces: get the command loop working b. get individual commands to work (scoring is the most work, save it till last) Printing the string is best done by creating a new string and adding characters (upper, lower) to that string and then printing it. Then clear it before the next printing Process all pairs of strings in data file. 2. Sample data file dna.xt You may copy sample file: p SPUB/dna.txt aadbbbcccC and many more pairs What is name of the file that has DNA seqences: Matches: 7 Mismatches: 2 Str2: aaBbbCccc dna.txt Matches: 7 Mismatches: 3 Stri: AaDbbbcccC Str2: BaAbbbcCCD Matches Mismatches Stri: Str2