No Need for coding just an explanation of advantages.

Exercise 1 (10 pts) Examine the brute force string-matching algorithm given on page 105 (Section 3.2) of your textbook. In solving the string-matching problem, would there be any advantage in comparing pattern and text characters right-to-left instead of left-to-right? ALGORITHM Brute ForceString Match(T [O...n 1], P[0..m 1]) //Implements brute-force string matching //Input: An array T[O..n 1] of n characters representing a text and // an array P[0..m 1] of m characters representing a pattern //Output: The index of the first character in the text that starts a // matching substring or -1 if the search is unsuccessful for it O to n m - m do jro while j