Given the same pattern p and text t: t = "xxxyxxzxxy" p = "xxyxxx" use the boyer-moore algorithm from the online content to find all occurrences of p in t. a. for each step: show the alignment of t and p state which characters are a mismatch (or if there is a match, and state at what index) state which rules could be applied, and which will be used to shift p the farthest, and show how far it will be shifted at the end, state how many total character comparisons were made for this search