3 Subsequence A string P is a subsequence of string T if we can obtain P from T by removing 0 or more characters in T. For instance, aba is a subsequence of bcadfbbba. 3.1 Give a linear time algorithm that decides wether a string P is a subsequence of a string T. 3.2 Given k strings P1, P2, ..., Pk, and a string T, give an algorithm that decides which of the k strings that are subsequences of T.