$($b$)($i$)$ Show how the Boyer$-$Moore algorithm performs the

preprocessing to compute the two arrays charJump and

matchJump for the string pattern "PAPAYA".

$(6$ marks$)$

$($ii$)$ Show how the simple Boyer$-$Moore algorithm and the Boyer$-$

Moore algorithm find the string pattern "PAPAYA" in the text

"BANANA KAYA PAPAYA...". Note there is only one space

character in between the words in this text. How many character

comparisons are done by each algorithm in searching for the

pattern in the text?

$(9$ marks$)$