Given two strings A[1...n] and B[1..m], such that n >= m, propose an al- gorithm to find the number of distinct subsequences that can be formed from A such that they are identical to B. = caaat and B...

Extracted text: Given two strings A[1...n] and B[1..m], such that n >= m, propose an al- gorithm to find the number of distinct subsequences that can be formed from A such that they are identical to B. = caaat and B = cat, then the answer is 3, since the For example, let A subsequences ca.t, c_a_t, and cat are identical to B.