4- Based on your understanding of the longest common subsequence problem, write a dynamic programming code to solve the problem asing C++. Your code must process two sequences (arrays) of type character and return the longest common subsequence between them and its length. Hint: You can refer to the pseudo code in the slides