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

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

1 def find boyer moore(T, P) 2 Return the lowest index of T at which substring P begins (or else -1).""" 3 ) 4 ifm== 0: return 0 5 last- 6 for k in range(m) n, m = len(T), len(P # introduce convenient notations # trivial search for empty string # build 'last' dictionary last[ P[k] ] k # align end of pattern at index m-1 of text # later occurrence overwrites # an index into T # an index into P 10 11 k=m-1 while i