In class we wrote the program to find all alignments between a pair of sequences when we add gaps to the shorter sequence. you can find that code on the sample code page. modify this code so that it computes the score for each alignment using the following scoring: match = +1 mismatch = -1 gap = 0 the program should find the optimal alignment(s) and print them with their score. now add two counters and some print statements to your code to count how much work is done by this algorithm to find the optimal alignment. the main units of work in this program are adding a gap to a sequence, and comparisons to compute the score. you may use global variables to store the amount of work that is done. test your result on the following sequences:how much work does the algorithm do on these sequences? note: to use a global variable to represent the amount of work required to insert gaps into the sequences, include the following line of code in each function where you reference the variable: