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