$(6$ pts$.)$ Draw the deterministic finite automaton in the Knuth$-$Morris$-$Pratt sub$-$

string search algorithm for the target string $s=$abcabc over the alphabet $\{a,b,c\}.$

Show in each iteration how you get the moves to the next state.