Using python

Problem Description: (String exercise This assignment will give you more experience with while/for loops and if statements, and give you an opportunity to work with strings. The Problem Scientists measure how closely related a species is by looking at the DNA sequences for key proteins and seeing how similar/dissimilar 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 relationship 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 Species 2: AAAACGAAAA Program Specifications 1. You will read two strings at a time (one string on each line) and do scoring operation. The strings can have any characters you like, but to be "biological" it should consist of: "A", "T", "C", "G" but it is not the requirement. Scoring. You will report the number of matches and the number of mismatches. Requirement: 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 and/or lower case. Print match count and mismatch count You print both strings After you score i. Matching characters are printed in lower case. If the string was in upper case letters, you convert them to lower case on a match. . 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) 2. Printing the string is best done by creating a new string and adding