Write a recursive method called (a, b) that calculates the length of the longest common subsequence (lcs) of two strings. For example, given the two strings aaacommonbbb and xxxcommonzzz the lcs is common which is 6 characters long so your function would return 6. The length of the lcs of two strings a

Explanation:

The following code is written in Java and creates the recursive function to find the longest common substring as requested.

 static int (String X, String Y) {

       int m = X.length();

       int n = Y.length();

       if (m == 0 || n == 0) {

           return 0;

       }

       if (X.charAt(m - 1) == Y.charAt(n - 1)) {

           return 1 + (X, Y);

       } else {

           return Math.max((X, Y),

                   (X, Y));

       }

   }

2b2t

explanation:

2b2t