Write a program that reads two strings from an input file (The
first line is X, the second line is Y), compute the longest common
subsequence length AND the resulting string.
You will need to write 2 methods
1) return LCS length in iterative function
// return the length of LCS. L is the 2D matrix, X, Y are the
input strings, m=|X|, n=|Y|
int lcs_it(int **C, string X, string Y, int m, int n )
2) return LCS resulting...