Assignment Pairwise Alignment

Use Needleman$-$Wunsch algorithm to align the following two sequences, with BLOSUM$50($matrix is shown at the end of this assignment$)$ and a linear gap penalty of $10(-10).$

$\{$:$[$S$1=$FDCVI$],["$ S$2=$ FHEVAI $"]$:$\}$

i$.$ Fill out the dynamic programming table

ii$.$ Highlight the optimal path

iii. Write out the optimal alignment

iv$.$ What is the score for the optimal alignment?

$-$ F H E V A I $-$ I F D W V I