Consider the two DNA sequences CAAG 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  C  A  A  G
O 0  
C
G

Let the match cost be 5, mismatch -4, and gap -20. Complete the
matrix above. (5 pts)

--------------------------------------------------------------

Consider the algorithm shown below:

count = 0
for i in range(0, len(X), 1):
	for j in range(0, len(Y), 1):
		if(X[i] == Y[j]):
			count++

Both X and Y are strings of lengths n and m respectively. Write
the total (theoretical) runtime of the algorithm above. Your
anwser would be a function of n and m. Follow the approach shown in
class. For each line write down each time as a variable and then 
add them up to obtain the total time. (5 pts)