#include  #include  using namespace std; int lcs(string X, string Y) { int n = X.size(); int m = Y.size(); int L[m+1][n+1]; for (int i = 0; i   (10 pts.) Modify the dynamic-programming algorithm for finding the length of longest common subsequences of two strings to produce a longest common subsequence