2. A special version of the motif-finding problem is the following: given n DNA sequences Si,...,Sn 2. A special versionof thnd a string f length ch thar dst algorithm for d ,e nico that x apes with at and integers l and d, find a string x of length such that x appears with at most d mutations in every sequence Si, or detect if no such x exists. Give a fast algorithm for d-0, i.e, for the case when the motif appears exactly in every input sequence St. Hint: for practical inputs the number of substrings of length l that appear in at least one input sequence is much smaller than 41 2. A special version of the motif-finding problem is the following: given n DNA sequences Si,...,Sn 2. A special versionof thnd a string f length ch thar dst algorithm for d ,e nico that x apes with at and integers l and d, find a string x of length such that x appears with at most d mutations in every sequence Si, or detect if no such x exists. Give a fast algorithm for d-0, i.e, for the case when the motif appears exactly in every input sequence St. Hint: for practical inputs the number of substrings of length l that appear in at least one input sequence is much smaller than 41