Construct the charJump and matchJump tables for the Boyer-Moore algorithm for the following patterns, assuming that the input alphabet is {A,B,,Z} : (i) AAAB (ii) A... AB(m1 A's followed by a B) For the matchJump table show how you derived your answer. How many character comparisons are performed by the Boyer-Moore algorithm in scanning for the pattern "A...AB" ( m1 A's followed by a B) in the text "A...A" ( n A's)? Show how you derived your