It is assumed that pre-processing time of KMP algorithm is more efficient than the pre-processing time of Boyer-Moore algorithm, the overall running time of KMP is rather efficient than Boyer-Moore.Is there an example Pattern p and text T to illustrate why one should not agree with this statement?