6 Preprocessing of the string matching automaton Give an efficient algorithm for computing the transition function & for the string-matching automaton corresponding to a given pattern P. Your algorithm should run in time 0(m/E). (Hint: Prove that 6(q, a) = 6(r[q], a) if q = m or P[q + 1] # a.)