Four and Five please, thank you !!

4. 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? (15 pts) a. 00001 b. 11000 c. 00100 5. Apply the (1) DFS-based algorithm and (2) source-removal algorithm to solve the topological sorting problem for the following digraph. (20 pts)