1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths of strings T and P * / 2. Repeat steps 3 to 6 while i

1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths
of strings T and P * /
2. Repeat steps 3 to 6 while i <>
3. Repeat for j = 0 to p – 1
5. Return index i and exit
6. i = i + 1
7. Return –1 for no match
8. Exit

run the above algorithm using functions