To find a match for a string of size m in a text of size n$,$ the Boyer$-$Moore algorithm would take $\_\_\_\_\_\_\_\_$ in the worst case.

Question $10$ options:

O$($n $+$ m$)$ time

O$($m$)$ time

O$($m$*$n$)$ time

O$($n$)$ time