write a python code for Given a set of DNA sequences $($dna$.$csv$),$ write a program to find the MOTIF $($ size

of the lmer is $6).$ You can implement using of Gibbs sampling algorithm.

$($a$)$ Estimate the time complexity $($by setting up a counter in your program$)$ and print

it$.$ In the end, we will analyze how much time is taken by algorithms.

$($b$)$ In the case of Gibbs sampling approaches, show how the score

$($computed based on the profile matrix$)$ varies as the number of steps or as

computation progresses. Does it converge to a constant value? Comment on it$.$