Easy Study Question

6. Given two string sequences 1 and 2. find the length of the Longest Common Subsequence (LCS) of them. What is the LCs of the two strings? Fill in the matrix L below using Dynamic Programming (20 Points) String 1 - "ABAZDC" String 2 - "BACBAD L: 0 0 0 0 0 0 D 0 10 BO A 0 2 DO C 10 Length of the LCS = --- What is the LCS Here is par of the code: If (input[i] == input[j]){ L[i][j] = 1+ L[i-1][j-1]; else L[][j] = max (L[i-1]6), L[i][i-1])