07.作業七 Longest Common Subsequence

Given two sequences A and B in alphabet P, determine the longest common subsequence (LCS) of A and B.

Bonus:

1. Report all LCSs of A and B;