Help me with this in java

Introduction: In $1977,$ Dr$.$ Robert S$.$ Boyer and Dr$.$ J$.$ Strother Moore published a paper describing an algorithm to find a string of characters $($called a pattern$)$ in a large text called $$Fast String Searching Algorithm$.$ You can read it here. The easiest way to check if a pattern can be found in a text is by starting at the beginning of the text and then matching each letter of the pattern against the text. If a letter matches, check the next letter. If there is a mismatch, slide the pattern one character to the right and then try to match the whole pattern again. which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $($mismatch$.$ Move one to the right$)$ which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $($mismatch$.$ Move one to the right$)$ which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $($mismatch$.$ Move one to the right$)$ etc. The approach above, while guaranteed to find if a match exists or not, is slow as every character of the text and the pattern must potentially be checked more than once. The reason the Boyer Moore approach was considered fast was because the algorithm allows a computer to skip checking parts of the text depending on which part of pattern caused a mismatch on the text. The idea is to compare the pattern backwards relative to the text, and then slide the pattern forwards a number of character, depending on the character that caused the mismatch. which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $($f does not show up in pattern: Skip past f$)$ which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $(-$ shows up in pattern: Skip to match pattern$$s last $-)$ which$-$finally$-$halts.$--$at$-$that$-$point at$-$that $($t matched but a did not. l does not show up in pattern: Skip past l$)$ etc. Their algorithm is comprised of a total of $4$ observations. These observations dictate how much of the text we can skip checking based on which character in pattern failed to match. We will implement Observations $1,2,$ and $3($a$)$ in this assignment. Note that their original paper describes building a skip table, so we can quickly lookup how much of the text can be skipped, based on the mismatch between the pattern and the text. We will not build this table but, instead, calculate the skip every time we need to slide the pattern down the text. And we$$ll do so recursively.