Using this scoring system $($Match $=+1$; Mismatch $=-1$; Gap $=-2)$ and the

path graph overleaf, use the dynamic programming method to determine

the optimal global alignment$($s$)$ of the sequences TGCA and TGCCA.

Show all calculations clearly, the optimal alignment$($s$)$ and the associated

score. You can write directly on the graph and include it in your answer

book.