D Question 3 1 pts In Sequence Alignment (Algorithm Design Chapter 6.6). defines a gap penalty. represents the mismatch cost for lining up p with q. Then which of following does the minimum alignment costs satisfy the recurrence for i >1 and j 2 1? O OPT(i'l-min@gi'yi+OPT(i-1.j-1)OPT(i-1.j-1),+OPT(i-1.j-1)]