Construct a pattern of length 8, over the alphabet a, b, such that the number of comparisons in Knuth-Morris-Pratt Algorithm is as large as possible. (determine a pattern using only a and b that makes as many comparisons as possible for ANY string). Explain your answer.