Recall from Assignment 6 the dynamic programming algorithm f…
Recall from Assignment 6 the dynamic programming algorithm for sequence alignment.We shall now use that to find the optimal alignment of AC with CAT assuming that g = 2 (the penalty for a gap) d = 3 (the penalty for a mismatch). Fill in the missing entries in the table Then list the optimal alignment.(You need to argue only for the last column.)