What is a key feature of the Boyer$-$Moore string matching algorithm? It intelligently skips certain sections of the text It uses hashing that can be easily modified It searches all possible permutations of the string for a pattern It creates a finite state machine so other states can be added to modify the algorithm