Qusetion: In 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 characters, called the target, in a string of n characters, where ≤ n, called the text.
b) Express your algorithm in pseudocode.
c) Give a big-O estimate for the worst-case time complexity of the brute-force algorithm you described.