Checkpoint L$2\mathrm{.}3$ Better String Matching with KMP

Implement the Knuth$-$Morris$-$Pratt algorithm as discussed in

lectures. You should attempt to implement the algorithm

yourself, but you are allowed use the wonders of the Internet as

a resource $($and the lecture slides$).$ However, please do include

the reference to the source of your implementation and it must

conform to the implementation above and include the number

of comparisons.

There are variants of the KMP algorithm so be sure to

implement the lookup table as described in the lectures to

get the correct number of comparisons.