Describe an example of a text T of length n and a pattern P of length m such that force the brute-force pattern-matching algorithm achieves a running time that is ( nm ).   Adapt the brute-force...

Describe an example of a text
T
of length
n
and a pattern
P
of length

m
such that force the brute-force pattern-matching algorithm achieves a

running time that is (nm).

Adapt the brute-force pattern-matching algorithm in order to implement a

function, rfind brute(T,P), that returns the index at which the
rightmost

occurrence of pattern
P
within text
T, if any.