a$)$ Compute the failure array of the KMP algorithm for the pattern $\backslash ($ P$=\backslash )$ miamiami.

b$)$ Show how to search for pattern $\backslash ($ P$=\backslash )$ miamiami in the text $\backslash ($ T $\backslash )=$imiamifrommiamiamigo using the KMP algorithm. Indicate in a table, like the one below, which characters of $\backslash ($ P $\backslash )$ were compared with which characters of $\backslash ($ T $\backslash ).$ Follow the example we saw in the slides, and place each character of $\backslash ($ P $\backslash )$ in the column of the compared$-$to character of $\backslash ($ T $\backslash ).$ Put brackets around the character if an actual comparison was not performed.