Implement algorithm GetExp (s, i)  pre-cond: s is a string of tokens, andi is an index that indicates a starting point within s.  post-cond: The output consists of a parsing p of the longest substring s[i], s[i + 1], ... , s[j − 1] of s that starts at index i and is a valid expression. The output also includes the index j of the token that comes immediately after the parsed expression.

In each case, you should provide two strings in L and two strings not in L in the spaces provided.  (All of the strings must be in Σ∗) : *Check uploaded image*

Longest Common Subsequence:ExampleLCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.LCS for input Sequences “AGGTAB” and “GXTXAYB” is “GTAB” of length 4.Implementation in Java.

JAVA Task, by using ArrayList   The program reads manatee names from the standard input stream and from time to time prints a sorted portion of the list of names. All the manatee names in the input are given in the order in which the necropsy was performed. You can imagine a unique timestamp associated with each necropsy. The names are not necessarily unique (many of the manatees have the same name). Interspered in the standard input stream are queries that begin with the question mark character. Queries ask for an alphabetical list of manatee names to be printed to the standard output stream. The list depends only on the names upto that point in the input stream and does include any manatee names that appear in the input stream after the query. The list does not contain all the names of the previous necropsies, but only a selection of them. A query provides the names of two manatees, say A and B. The response to the query drops necropsies performed before the first named A and all the…