Write a Python functions called NWscore that takes as input two DNA 
sequences and match, mismatch, and gap costs and outputs the optimal 
alignment score as given by the Needleman-Wunsch algorithm.

def NWscore(seq1, seq2, m, mm, g)

You may assume that you have a function called computeVandT(seq1, 
seq2, m, mm, g). This returns the optimal alignment scoring matrix V 
and tracback matrix T of DNA sequences seq1 and seq2 with match, 
mismatch, and gap costs of m, mm, and g respectively. This function 
is given in the file alignment.py.

Submit hardcopies in class on Feb 25th.