Consider the two DNA sequences AGTCACG and AGACTG. We want to globally align them with the Needleman- Wunsch algorithm. First, we need to compute the optimal scoring matrix V shown below. Let the match cost be 3, mismatch= -1, and gap=-2. 1. Draw and fill up the scores table V using the Needleman-Wunsch recurrence (10 pts) v[i][j] = max { 2. Draw and fill up the traceback matrix. (8 pts) V[i-1] [j-1] + m(or mm) V[i-1] [j] + g V[i][j-1] + g 3. Write the final global alignment given by your traceback matrix. (7 pts) Activate Windows