To find a match for a string of size $m$ in a text of size $n,$ the brute$-$force algorithm would take in the worst case.

$O(n)$ time

$O(m)$ time

$O(m**n)$ time

m$)$rtime