1. [3] Longest Common Subsequence (LCS): Given 2 sequences, X= (x1,...Xn) and Y = (V1.....yn), find a common subsequence whose length is maximum. Subsequence need not be consecutive, but must be in order. if (A[i] = B[j]) LCS[i,j] = 1 +LCS[i-1, 3-1); else LCS[i,j] = max(LCS(i-1, j), LCS(i, j-1)); a) Find LCS for strings X = (longest), Y = (stone). What are the LCS and its length