Design an algorithm for solving this puzzle and determine the number of moves it makes. [Gar99] From Book Exercises 3.2 Q3. [6 points] 5. How many comparisons (both successful and unsuccessful)

are made by the brute-force string-matching algorithm in searching for each of the following patterns in the binary text of 1000 zeros? a. 00001 b. 10000 c. 01010 Show your work.