a. Explain how to use a brute-force algorithm to find the first occurence of a given string of m characters, called the target, in a string of n characters, where m n, called the text. Hint: Think in terms of finding a match for the first character of the target and checking successive characters for a match, and if they do not all match, moving the start location one character to the right 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