In Java implement the Dynamic programming algorithm for the LCS problem in Code Fragment 13.7 and run your code on Example in Figure 13.14 Your program should print out the table and the alignment in Figure 13.14.

/ Returns table such that L[j][k] is length of LCS for X[0..j1] and Y[0..k1]./ public static int[ ][ ] LCS(char[ ] X, char[ ] Y) \{ int n=X.length; int m=Y.length; int [][]L=new int [n+1][m+1]; for ( int j=0;j<>