n this exercise we deal with the problem of string matching.

$($a$)$ Explain how to use a brute$-$force algorithm to find the first occurrence of a given string of m

characters, called the target, in a string of n characters, where m $<=$ n$,$ called the text. $[5$ points$]$

$($b$)$ Express your algorithm in pseudocode. $[5$ points$]$

$($c$)$ Give a big$-$O estimate for the worst$-$case time complexity of the brute$-$force algorithm you de$-$

scribed. $[5$ points$]$