1. LCS algorithm gives a way to decide how similar two given strings are. However, sometimes, we have to filter away some common subsequences that are in some pattern. Here is a problem for you to solve. Given two strings oa and B, let y to be a longest word satisfying all of the following conditions: is a subsequence of a; . is a subsequence of ; e does not contain abb Design an algorithm that finds such a for any given and . Also, analyze its complexity