(Solved) : Implement Given Code Solve Longest Common Subsequence Problem Dynamic Programming C Need I Q32768869 . . . .

Implement the given code to solve the Longest CommonSubsequence problem by dynamic programming in C++

You need to implement the basic algorithm which takesO(nm) time& space to find the subsequence. Your algorithm should identifythe longest common sub-sequence (and not just give its length).

Program Input: your program shouldprompt the user to enter two strings from keyboard, representingtwo DNA sequences on alphabete of {A, C, G,T}.

Error checking: before executing thealgorithm, your program should check both strings to ensure onlyacceptable DNA letters (A, C, G, T) are entered. Do not run thealgorithm if they contain any errors inside. In the event of anerror, indicate