Complete the following table constructed by the Dynamic Programming (DP) algorithm for finding the Longest Common Sub-Sequence (LCS) between two sequences X and Y.

Also highlight the characters in the LCS table. X = (A, B, C, B, D, A, B) and Y = (B, D, C, A, B, A)

1. Complete the following table constructed by the Dynamic Programming (DP) algorithm for finding the Longest Common Sub-Sequence (LCS) between two sequences X and Y. Also highlight the characters in the LCS table. X=(A,B,C,B,D,A,B)andY=(B,D,C,A,B,A) 2. for the following instance of the Assembly-Line Scheduling problem, complete the following table constructed by the Dynamic Programming (DP) algorithm. The station time and the transfer times are indicated in the diagram below