Indicate precisely what character comparisons would be made and the total number of comparisons required if the Boyer Moore (BM) algorithm were used to locate the first occurrence of the pattern s = abacaba (of part (2(a)) in the text

t = abbcabcabacabaa.

Note. You can copy and paste the table included for each step of the algorithm (two tables have been included so you have a back up table).

[7]