(i) Given an alphabet ={A,B,..,Z} calculate the tables charJump and matchJump as used by the Boyer-Moore searching algorithm for the pattern SINGLING showing for matchJump how you derived your answer. ii) Determine the number of character comparisons made by the Boyer-Moore algorithm when searching for the pattern SINGLING in the text BINGBINGCLINGSINGLING . Give a trace to show how you derived your answer, indicating at each stage the values of charJump and matchJump considered in determining the next move. [10 marks]