Please write a python code to solve the code challenge. Please use the sample input and output.

Code Challenge: Implement MotifEnumeration (reproduced below) . Input: Integers k and d, followed by a collection of strings Dna. Output: All (k. d)-motifs in Dna. . MotifEnumeration (Dna, kd) Patterns - an empty set for each k-mer Pattern in Dna for each k-mer Pattern differing from Pattern by at most o mismatches if Pattern appears in each string from Dna with at most d mismatches add Pattern to Patterns remove duplicates from Patterns return Patterns Extra Dataset Debdo Datos Sample Input: 31 ATTTGCC TGCOTTA CGOTATC GAAAATT Sample Output: ATA ATT GIT TTT