Answer
See explanation
Work Step by Step
The best case will be when the string is found in the first test itself and the number of comparisons will be m. This will be the best case when pattern is much smaller than text.
In the case where pattern is almost equal to text in size, the best case will be when the first character of pattern is not present in the text and number of comparisons will be n-m+1.
