(c) (10 points) For a LCS (longest common subsequence) problem with two input sequences X =< B, A, B, A, C, D, C> and Y
Posted: Tue Jul 12, 2022 8:21 am
(c) (10 points) For a LCS (longest common subsequence) problem with two input sequences X =< B, A, B, A, C, D, C> and Y =< C, B, A, B, D, A, C >, please draw the table(s) as in the book. (d) (3 points) Based on the table(s) in (c), what is the longest common subsequence for X and Y?