The best case of na$$ve algorithm that finds the all occurrences of a pattern is

a$.$ O$($n$*$m$)$

b$.$ O$($n$/$m$)$

c$.$ O$($n$+$m$)$

d$.$ O$($n$-$m$)$

what is the correct answer