Answer quickly for a thumbs up, thank you! Assume you have a string that can contain the following set of characters: 1. Construct the shift table using Horspool's algorithm, given the following pattern: ( 6 pts) F#EDEF#F#F# 2. How many character comparisons would be needed to find this pattern in the following string using Horspool's algorithm? Show your work to get partial credit. (14 pts) C#BABC#C#C#BBBC#EEF#EDEF#F#F#F#EEF#ED.