Problem
1. Give an efficient algorithm for determining if a pattern P is a subsequence (not substring) of a text T. What is the running time of your algorithm?
2. Let x and y be strings of length n and m respectively. Define B(i,j) to be the length of the longest common substring of the suffix of length i in x and the suffix of length j in y. Design an O(nm)-time algorithm for computing all the values of B(i,j) for i =1,...,n and j = 1,...,m.