(Solved): PART A: The brute force algorithm for string matching is given below: ALGORITHM BruteForceStrin ...

PART A: The brute force algorithm for string matching is given below: ALGORITHM BruteForceStringMatch $(T[\mathrm{0..}n?1],P[\mathrm{0..}m?1])$ //Implements brute-force string matching //Input: An array $T[\mathrm{0..}n?1]$ of $n$ characters representing a text and /I an array $P[\mathrm{0..}m?1]$ of $m$ characters representing a pattern //Output: The index of the first character in the text that starts a II matching substring or -1 if the search is unsuccessful for $i?0$ to $n?m$ do $j?0$ while $j<m$ and $P[j]=T[i+j]$ do $j?j+1$ if $j=m$ return $i$ return -1 Write a code to implement this algorithm in the language of your choice. Paste your complete code here: