Problem $7[10$ marks$]$

Consider the Boyer$-$Moore algorithm as seen in class. Let $\backslash (\backslash$Sigma$=\backslash \{$a$,$ b$,$ h$,$ l$,$ n$,$ o$,$ s$\backslash \}\backslash ).$

a$)$ Compute the last$-$occurrence function $($for each character of $\backslash (\backslash$Sigma $\backslash ))$ and the suffix skip$-$array over the pattern $\backslash ($ P $\backslash )$ honololo.

b$)$ Show how to search for pattern $\backslash ($ P$=\backslash )$ honololo in the text $\backslash ($ T$=\backslash )$ bonololohononolohonololo using the Boyer$-$Moore algorithm. Indicate in a table like the one below which characters of $\backslash ($ P $\backslash )$ were compared with which characters of $\backslash ($ T $\backslash ).$ Place each character of $\backslash ($ P $\backslash )$ in the column of the compared$-$to character of $\backslash ($ T $\backslash ).$