Brute$-$Force String Matching Problem:

Given a string of $n$ characters called the text and a string of $m$

characters $(mn)$ called the pattern, find a substring of the text that

matches the pattern.

Consider the Brute$-$Force algorithm for that problem.

Choose the worst$-$case input for that problem for $n=13$ and $m=4.$

text: AAAAAAAAAAAAA

pattern: ABAB

text: ABABABABABABA

pattern: ABAB

text: AAAAAAAAAAAAA

pattern: BBBB

text: AAAAAAAAAAAAA

pattern: AAAB