Knuth-Morris-Pratt Algorithm

QUESTION 4 The Knuth-Morris Pratt Algorithm has been introduced to avoid computing the transition function of Automata and, most importantly, to avoid comparing useless shifts of the naive algorithm. This can be achieved by precomputation of the auxiliary function II as explained in the lecture and book. For the patterns P1="tartans" and P2="abaaabbabb" fill out the following tables showing the precomputed entries of the auxiliary function for both patterns: i 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8 9 10 aaaabbabb