Consider an execution of Boyer-Moore with the pattern P="goggles" and a host string T. Assume that, with a

shift value of i, the algorithm reads character T[i+6] and finds that this character is 'g'. By how much should

the shift i be increased (according to the bad character rule)?