Perform an experimental comparison of the rleative speeds of the KMP patter nmatching algorithm.

Implement the KMP Fail function below and test it on a small, medium, and large text document. Documenting the run time for each test.

The Knuth-Morris-Pratt (KMP) Algorithms: 1 def compute.kmp.fail(P) 2 Utility that computes and returns KMP 'fail list." 4 fail = [0] * m 6k=0 m = len(P) # by default, presume overlap of 0 everywhere # compute f(j) during this pass, if nonzero # k + 1 characters match thus far 7 while j 0: # k follows a matching prefix else # no match found starting at J