The LCS algorithm used dynamic programming to produce the below $"$b$-$table" to determine a

longest common subsequence for two strings $x$ and $Y.$

Letters $d,$I, and $u$ stand for: $d=$ diagonal arrow $($lower right to upper left$),I=$ arrow to the left, $u$

$=$ upwards arrow.

The information in this table allows the determination of the longest subsequence.

Demonstrate that you know how this is done.

Answer $3$ questions, carry out one task:

What is string $x$ :

What is string $Y$ :

Mark by circling or highlighter the path through the b$-$table which reveals the LCS$.$

What is the LCS of $x$ and $Y$ :