Given two different strings, please write a program Ies (str1, str2) to find the longest common subsequence (LCS). For examples: LCS for input Sequences "ABCDGH" and "AEDFHR" is "ADH" of length 3. LCS for input Sequences "AGGTAB" and "GXTXAYB" is "GTAB" of length 4. Use C, C++ or Java.