Can someone explain this “Longest Common Subsequence” algorithm?

Question

The Longest Common Subsequence (LCS) problem is: given two sequences A and B, find the longest subsequence that is found both in A