Write from scratch a c++ program that computes the value and the structure of the longest common subsequence of a pair of strings. The strings must be on the command line as is done in the global alignment program. Implement your alignment algorithm recursively, not iteratively. The traceback portion can be either iterative or recursive.

program should look exactly like this:

./last_f_421 GDVEGTA GVCEKST The LCS has length 4 The LCS is GVET