Fill in the dynamic programming table to perform optimal global alignment between the DNA

sequences $r=$ CAACGAT and $s=$ CACATTA. Each match has a score of $+1,$ each mismatch has a

score of $-1$ and each indel has a score of $-2$ without affine gap penalty. Draw all arrows that lead

to the score of each cell $($i$.$e$.,$ the "red arrows"$).$

tepptx if you want. Report the optimal

alignment score and all alignments with this optimal score. When showing an alignment,

indicate the names of the sequences clearly.

$(30\%)$

Repeat Question $1,$ but perform a local alignment instead of a global alignment. When showing

an alignment, indicate the sequence names and the starting and ending positions of the aligned

regions clearly.

$(30\%)$