Given a set S of k strings, we want to find every string in S that is a substring of some other string in S. Assuming that the total length of all the strings is M, give an O(M + k 2 )-time algorithm to solve this problem