You the longest consecutive sequence of letters that appears in bot T. are given two strings of english letters S and T. Your so goal is to find h both S an For example, if S = temporarily and T empor emporium, then the output is escribe a dynamic programming algorithm for this problem that runs in time O(length(S) length(T)). For this problem, write pseudocode, and make sure to return the actual substring, not just its length. (If there are multiple longest substrings, you only have to return one of them.) HINT 1: This problem is easier if you set Tli.j] be the length of the longest cornmon substring of Xi, Xi and Yi, Y, that ends in Xi and Y. So in particular, if XiY, then T[i.j] = 0, because a common substring cannot end in two different letters HINT 2: for this problem, returning the actual sequence doesn't require storing an additional table S; there is an easier method for this problem. That being said, you are welcome to use a separate S table if that's more comfortable for you