For each of the texts below, determine the number of fundamental character comparisons needed to find all valid shifts for the test string x = “abcca” using the naive string-matching algorithm...

For each of the texts below, determine the number of fundamental character comparisons needed to find all valid shifts for the test string x = “abcca” using the naive string-matching algorithm (Algorithm 1) and the Boyer-Moore algorithm (Algorithm 2).