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

Given a profile matrix Profile, we can evaluate the probability of every k mer in a string Text and find a Profile-most probable X-mer in Textie, a k-mer that was most likely to have been generated by Profile among all k-mers in Text. For example, ACGGGGATTACC is the Profile-most probable 12 mer in GGTACGGGGATTACCT. Indeed, every other 12-mer in this string has probability o. In general, If there are multiple Profile-most probable k-mers in Text, then we select the first such k-mer occurring in Text Profile-most probable k-mer Problem: Find a Profile most probable k-mer in a string, Input: A string Text, an integer k, and a 4 ** matrix Profile Output: A Profile-most probable k-mer in Text. *Code Challenge: Solve the Profile-most probable k-mer Problem Extra Dataset Debug Datasets Sample Input: ACCTGITTATTGCCTAAGTTCCGAACAAACCCAATATAGCCCGAGGGCCT 5 0.2 0.2 0.3 0.2 0.3 0.4 0.3 0.1 8.5 8.1 0.3 0.3 0.5 8.2 8.4 0.1 0.2 0.1 0.1 8.2 Sample Output: CCGAG 12:29 AM 2/1/2021