Given two sequences X$=$ and Y$=,$ you need to use dynamic programming to compute a longest common subsequence $($LCS$)$ of X and Y$.$

What is the value of c$[1,1]?$

What is the value of c$[1,2]?$

What is the value of c$[1,3]?$

What is the value of c$[1,4]?$

What is the value of c$[2,1]?$

What is the value of c$[2,2]?$

What is the value of c$[2,3]?$

What is the value of c$[2,4]?$

What is the value of c$[3,1]?$

What is the value of c$[3,2]?$

What is the value of c$[3,3]?$

What is the value of c$[3,4]?$

What is the value of c$[4,1]?$

What is the value of c$[4,2]?$

What is the value of c$[4,3]?$

What is the value of c$[4,4]?$

What is the value of c$[5,1]?$

What is the value of c$[5,2]?$

What is the value of c$[5,3]?$

What is the value of c$[5,4]?$

What is the LCS$?$

OR