Consider the problem of finding the pattern POTATO in the text TATERTOTHOTDISH on the alphabet consisting only of the capitalized Roman alphabet. (a) Solve it by hand using Horspools algorithm, reporting the exact number of comparisons needed. Show all steps, including the shift table, and each alignment that happens. (b) Solve it by hand using the brute force algorithm for string matching, again reporting the exact number of comparisons needed. (c) Does the number of comparisons from the previous two questions allow you to make a conclusion about which algorithm is better? Explain..