Exercise 3

Populate the attached dynamic programming matrix using a scoring scheme of +2 for a match, -1 for a mismatch, and a linear gap penalty of 2. Use this to produce an optimal global alignment of the two sequences.