Problem
1. List the prefixes of the stringP = "aaabbaaa" that are also suffixes of P
2. Draw a figure illustrating the comparisons done by brute-force pattern matching for the text "aaabaadaabaaa" and pattern "aabaaa".
3. Repeat the previous problem for the BM pattern matching algorithm, not counting the comparisons made to compute the last(c) function.