Name:

$5.(3$ points$)$ LCS DP table. In the LCS problem, we are given as input two sequences, $x=($:$x_1,x_2,$dots,$x_m$:$)$ and $Y=($:$y_1,y_2,$dots,$y_n$:$)$ and would like to find a longest subsequence common to both. Towards this end, we defined $c[i,j]$:$=l$ length of LCS of $x_i$ and $Y_j,$ DS table of entries $c[i,j].$ ii$)$ Give an LCS of $x$ and $Y$

$\backslash$table$[[,j,0,1,2,3,4],[i,,y_j,B,C,A,B$