please show steps and answer these two questions will upvote

1. draw diagrams to show how to use a kmp algorithm to solve this problem .calculate a failure functions . answer this (what is the number of places to shift the pattern right by using the failure function in each step and how many comparisons are performed to find the pattern in the text .

2. 1. draw diagrams to show how to use a boyer-moore algorithm to solve this problem .calculate a failure functions . answer this (what is the number of places to shift the pattern right by using the good suffix and bad character heuristics in each step and how many comparisons are performed to find the pattern in the text

Problem 3 Pattern Matching Problems ( 25 pts) Given a text and a pattern as shown below, return the lowest index of the pattern in the text. If the pattern does not exist in the text, return -1. Text: she sells seashells by the seashore Patten: seashore