Do a precise analysis of the worst-case running time of the function. I want an exact expression, not an approximation (No big-O here). I also want to see how you obtain your results. Show me work to convince me that you understand how to compute the exact running time of this function. When you are done, give the big-O bound.

Look carefully at this code and understand it def f(p, t): mlength(p) n length(t) for i from 0 to n-m while j