Please write a python code to solve the code challenge. Please use the sample input and output. Please show me the code you use on a python sheet, so I can know how to put it in python.

Code Challenge: Implement Greedy Motif Search with pseudocounts. Input: Integers k and followed by a collection of strings Dna Output: A collection of strings Best Motifs resulting from applying GreedyMotitSearch(Ona, k) with pseudocounts. If at any step you find more than one Profile-most probable k mer in a given string, use the one occurring first Visit the code graded challenge! Extra Dataset Debug Datasets Sample Input: 35 GGCGTTCAGGCA AAGAATCAGTCA CAAGGAGTTCGC CACGTCAATCAC CAATAATATTCG Sample Output: TTC ATC TTC ATC TTC