You have been provided with the following string matching algorithms: Boyer$\_$Moore.py$,$ Brute$\_$force.py$,$ KMP$\_$matcher.py$,$ and Rabin$\_$Karp.py$.$ Using any of these algorithms, I want you to find the word$($s$)$ that have:

$1.$ Longest Continual Substring of:

Vowels

Consonants

$2.$ Longest Continual Prefix of:

Vowels

Consonants

$3.$ Longest Continual Suffix of:

Vowels

Consonants

Example: $["$Hello$",$ "World", "Face","Asthma", "Spring", "Because", "Thorough", "Sequoia" $].$ In this list of strings, "Sequoia" has the longest substring of consecutive vowels. "Asthma" has the longest substring of consecutive consonants. "Asthma" Also has the

longest prefix of consecutive vowels. "Spring" has the longest prefix of consecutive consonants. "World" has the longest suffix of consecutive consonants and "Sequoia" has the longest suffix of consecutive vowels. Your word file is going to be a long excerpt from

"Lorem Ipsum" text found in lore$\_$ipsum.txt$.$ If there are multiple words that tie in any criteria, return ALL words that tie. You can assume that the only characters in the file will be standard English letters, no numbers, special characters, or characters with diacritic marks.