Consider the two DNA sequences ACCG and CG. We want to align
them with the Needleman-Wunsch algorithm. First we need to
compute the optimal scoring matrix V shown below. The empty
string is denoted by O.

  O  A  C  C  G
O 0  
C
G

Let the match cost be 5, mismatch -4, and gap -20. 

a. Write out the first row and column of V (5 pts)

b. Write out second row of V using the Needleman-Wunsch 
recurrence

                                V[i-1,j-1] + m (or mm)
                V[i,j] = max{   V[i-1,j]+g
                                V[i,j-1]+g

Submit hardcopies in class on Feb 14th.