LCS. You want to compute an LCS of two sequences, X = 01001101 and Y = 10010101. Illustrate how the DP works on this instance as shown in Fig 15.8 in thetextbook. Make sure that you show b[i, j] (arrow) and c[i, j] (length of LCS of Xi and Yj) for all pairs of 0 i 8 and 0 j 8. Also as in the gure, highlight a path leading to a LCS

15.4 Longest common subsequence j 0 1 3 5 D C A B 0 3 0 0 0 0 0 0 0 1 A 2 B 0 1 1 2 4 2 2 2 0 1 2 2 3 3 0 2 2 2 3 3 0 1 2 2 4 4 Figure 15.8 The c and b tables computed by LG D, A, B) and Y (B, D,C, A, B, A). The square and the appropriate arrow for the value of bli, j of the table is the length of an LCS B, C, B, A only on whether x y j and the values in entries are computed before cli jl. To reconstruct the el the lower right-hand corner: the sequence is shade