www.swamiyer.net/cs110/project3.pdf Problem 2. (Recovering the Alignment) Now that we know bow to compute the edit distance between two strings, we next want to recover the optimal aligument iteelf. The key idoa is to retrace the stepe of the dynamic programming algorithm backwards, re discovering the path of choices (highlighted in rod in the table above) from opt to) to) to opt 0O 03. To determine the choioe that lod to ope ta) tg], we consider the throe posibilitios: 1. The optimal alignment matches xta] up with a gap. In this case, we must have epeta-ope 130)2 2. The optimal alignment mathes , up with a gap. In this case, we must have optiuj)-opt tut + 1] + 2. 3. The optimal aligament matches [A] up with yt). In this case, we must have opt (41111 opeta 1+1 if x(1) equals 3), or optag opes 11 otherwise. Write a program lsaeat. py that reads from standard inpat, the output produced by otie distance.r, ie, input strings and y, and the opt matrix. The program should then recover an optimal alignment using the procedure described above, and write to standard output the edit distance between z and y and the alignmeut itself, using the following format The first line should contain the edit distance, preceded by the text Bait distaace-. Each subeequent lise should coutain a character from the first string, followed by the paired character from the second string, followed by the associated penalty. Use the duaracter e to indicate a gap in either string. 3 of 5 CS110 Project 3 (Global Sequence Alignment) Swami lyer s rthens edis aistance Py data/exsapleto.txt Ipyhon3 aligaest py Edit diataace 7 ! c 2 TG1 cco CAI