These questions in design and analyze of algorithms

Exercise 3 (13 Points) Design an algorithm that can look for the existence of any integer series of numbers in an input array of n integers. We assume that a series of integer numbers is a succession of at least 3 consecutive integer numbers which are located in contiguous cells in the input array. Example: If the input array is: 12, 110, 13, 14, 15,21, 10. Then the algorithm should output this array includes one series that starts at the third cell and ends at the fifth one" Exercise 4 (10 Points) How many comparisons (both successful and unsuccessful) will be made by the brute-force algorithm in searching for each of the following patterns in the binary text of one thousand zeros? a. 00001 b. 10000 c. 01010