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

ApproximatePatternCount (Text Pattern, d) count for i @ to Text Pattern Pattern Text(i. Pattern) if HammingDistance (Pattern, Pattern') sd count count + 1 return count STOP and Think: What is the running time of ApproximatePatternCount? Code Challenge: Implement ApproximatePattern Count. Input: Strings Pattern and Text as well as an integer d. Output: Counts(Text, Pattern). Extra Dataset Debug Datasets Sample Input: GAGG TTTAGAGCCTTCAGAGG 2 Sample Output: ps passed 15 out of 40 points received TH Computing Count.Text. Pattern) simply requires us to compute the Hamming distance between Patter and every k mer substring of Text which achieved by the following pseudocode. ApproximatePatterncount(text, Pattern, d) count for to Text Pattern Pattern - Text Pattern if HandDistance(Pattern, Pattern 18 count Count 1 return count STOP and think what is the running time of Approximate PattemCount be Chanor implement ApproximatePatternCount. Input: Strings Pattern and Text as well as an integer d. Output: Count. (Text Pattem)