asymptotic analysis of algorithms

Program Analysis 1. For this question we will consider the following problem. Inputs: D: a document which is a sequence of tokens (t1; : : : ; tn) where n  1 and for 1  i  n the token ti is a string of characters. L: a sequence of words (w1; : : : ; wm) where m  1 and for 1  i  m the word w is a string of characters. Output: The longest token in the sequence D that is a substring of all of the words in L. If none of the tokens in D are substrings of the words in L then the empty string should be returned. A string x is a substring of a string y if the string x can be found anywhere within y. Note that a string is a substring of itself. look up the rest tin the attachment file