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

Not sy . Code Challenge: Implement GreedyMotif Search Input: Integers k and followed by a collection of strings Dna, Output: A collection of strings BestMotifs resulting from applying GreedyMotif Search Ona, k, 0). If at any step you find more than one Profile-most probable k-mer in a given string, use the one occurring first. Note: If you are not satisfied with the performance of GreedyMotif Search - even if you implemented it correctly - then wait until we discuss this algorithm in the next lesson Extra Dataset Debug Datasets Sample Input: 35 GGCGTTCAGGCA AAGAATCAGTCA CAAGGAGTTCGC CACGTCAATCAC CAATAATATTCG Sample Output CAG CAG CAA CAA . . Input: Integers k and t, followed by a collection of strings Dna. Output: A collection of strings BestMotifs resulting from applying GreedyMotifSearch(Dna, k, t). If at any step you find more than one Profile-most probable k-mer in a given string, use the one occurring first. Note: If you are not satisfied with the performance of GreedyMotif Search even if you implemented it correctly - then wait until we discuss this algorithm in the next lesson Extra Dataset Debug Datasets Sample Input: 35 GGCGTTCAGGCA AAGAATCAGTCA CAAGGAGTTCGC CACGTCAATCAC CAATAATATTCG Sample Output: CAG CAG CAA CAA RAM