Suppose all algorithms that solve a particular problem are in

$\backslash$Omega

$($

n

$3$

$)$

$.$

Using the above fact, what is the strongest statement $($of those

below$)$ that can be made about the fastest algorithm that solves

this problem in time

f

$($

n

$)$

$?$

f

$($

n

$)$

in

O

$($

n

$3$

$)$

f

$($

n

$)$

in

$\backslash$Theta

$($

n

$3$

$)$

f

$($

n

$)$

in

$\backslash$Omega

$($

n

$3$

$)$