(Dynamic Programming)

Im having trouble in this code. Below is the original skeleton code with the pseudocode

//package dp;

public class LCS {

public static int lcs_length (String X, String Y) {

/*

* fill in your code here

* Note: return the length of LCS, instead of c and b

*/

}

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

System.out.println(LCS.lcs_length("ABCBDAB", "BDCABA"));

System.out.println(LCS.lcs_length("ACCGGTCGAGTGCGCGGAAGCCGGCCGAA", "GTCGTTCGGAATGCCGTTGCTCTGTAAA"));

}

}

***Screenshot of code above***

Instructions. You are provided one skeleton program named LCS.java. The source files are available on Canvas in a folder named HW6. Please modify the skeleton code to solve the following tasks plement the lcs lengthi fiinction as discussed in Lecture 11 Note: You should not return the double-array b and c as in the pse docode. Instead, return the length of the longest common subsequence Hint To get the i-th character in a string s, use s.charAt(i). For example, the code String s "XYZ" System.out.println(s.charAt(1)); prints out Y