Given two lists, L of length n and L of length m. We say that L is a subsequence of L if we can remove elements from L to produce L2. This means that there exists indices i < ... < im such that L[ij] = L[j] for each j. Design an algorithm that detects if L2 is a subsequence of L and outputs the indices i,....,im if L2 is a subsequence of L. a. Provide the pseudo code of that algorithm. b. Implement the algorithm in a language of your choice and provide a sample run with meaningful input.