The problem is to write code in Python that incorporates this particular Brute Force String Match Algorithm while also adding a counter to keep track of the number of character comparisons made. The function ( def bfStringMatch(text,string): )should take in a long text and a shorter string and return a list containing two items. First, the position in the text of the first letter of the first occurrence of the string, and second, the number of comparisons made. The first position is -1 if the string does not occur in the text.

pari ALGORITHM Brute ForceString Match(T[0n-1], P[O.m-1]) Implements brute-torce string matching Input: An array To..n -1] of n characters representing a text and an array P[O.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 i+_ 0 to n-,n do while j