Write a Python script that reads in two unaligned sequences in FASTA
format from a file called "dna_fasta.txt" and outputs the scoring matrix 
V. This matrix contains the score of the optimal alignment of the two 
input sequences and their substrings from the start as we discussed in 
class. Submit a hardcopy on Feb 17th in class.

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

Recall the code for computing V is

Input: seq1 (along columns), seq2 (along rows)

Initilization: V[0,0]=0, V[i,0]=ig, V[0,j]=jg

Recurrence:

for i = 0 to length of seq2:
	for j = 0 to length of seq1:
		V[i,j] = max{V[i-1,j-1]+m/mm, V[i-1,j]+g, V[i,j-1]+g}

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

Complete the matrix V for sequences seq1="CTG", seq2="ACTGT",
m=10, mm=2, and g=-2.

		A	C	T	G	T
	0	-2	-4	-6	-8	-10
C	-2	
G	-4
T	-6

Write the complete matrix at the bottom of your Python script.