Please I need Q1, Q2 and the bouns as well if you can. Thank you bery much

Homework for text processing (1) How many character comparisons will be Boyer-Moore algorithm make in searching for each of the following patterns in the binary text of 1000 zeros? (a) 00001 (b) 01111 (c) 01010 (2) Compute the prefix function in KMP pattern match algorithm for pattern ababbabbabbababbabb when the alphabet is fa,b). How many character comparisons will be KMP pattern match algorithm make in searching for each of the following pattems in the binary text? a. Text: repeat "010011" 20 times. b Pattern: (a) 010010 b)010110 Bonus assignment Implement Brute Force, Boyer-Moore, and KMP pattern match algorithm, and search all matches for pattem 0101 from the text of a random binary string with length 10000. Homework for graph algorithms o) Do the Breadth-first search for the followinggaph staning at step bystep show: ces FIFO queue Q(the vertices under processing). dtv) (the distance from each vertex v to s) colorlv] color of each node Ivil, and parent ofeach node v) Do the Depa-first search for the following step by saamPA flv) final time stamp).colorlv] (color ofv), and plivleparert of )for each node v