Algorithms :Dynamic Programming: Longest Common Subsequence Problem:

Given two sequences $($ X $=$ "AGGTAB" $)$ and $($ Y $=$ "GXTXAYB" $),$ find the

length of the longest common subsequence $($LCS$)$ of $($ X $)$ and $($ Y $).$