There are two sequences X= and Y=. You need to use the dyna…
There are two sequences X= and Y=. You need to use the dynamic programming algorithm taught in class to compute a longest common subsequence (LCS) of X and Y. You need to compute the values of c and b. For the value of b, N denotes an up arrow, W denotes a left arrow, NW denotes an arrow to the upper-left. The value of b is