Consider the following dynamic programming equations for the global alignment algorithm (left) and scoring matrix (right): s(-1,-1)+c(x, yj) s(i, j)=max s(i-1, j)-cg s(i, j-1)-cg s(0,j)=-jcg s(i, 0)=-icg d P2 d a V e -1 -1 -1 a -1 2 -1 -1 V -1 -1 2 -1 e -1 -1 -1 2 Show the dynamic programming matrix between 'daave' and 'dva' using a gab penalty equals 2. Write down the optimal alignment score and the corresponding alignment between the two strings.