Why does the Boyer$-$Moore string matching algorithm require preprocessing?

$*$

$10$ points

It finds the longest common sequence of the search pattern P in the string text T

It is used to compute the states of the state machine

It is used to implement the good suffix rule

It is used to create an optimal hash table with the right prime number p