There are two sequences x $=$ c$,$ e$,$ c$,$ d$,$ e $>$and y $=$ c$,$ d$,$ c$,$ e$,$ e$,$ d$>.$ You need to use the dynamic programming algorithm $($shown in the attached images$)$

to compute a longest common subsequent $($LCS$)$ of X and Y$.$ You need to compute the values of c$[$i$,$ j$]$ and b$[$i$,$ j$].$ For the value of b$[$i$,$j$].$ N denotes an up arrow. W denotes a left arrow, NW denotes an arrow to the upper$-$left.

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

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

$3.$ What is the value of b$[4,3]?$ a$.$ N b$.$ NW c$.$ W

$4.$ What is the LCS computed by the algorithm?