What is Big

$($

$0$

$)$

$$Notation$?$

Big

$($

O

$)$

$$notation$...$

Pick ONE option

identifies the best algorithm to solve a problem.

determines maximum size of a problem that can be solved on a system in a given time.

is the lower bound of the growth rate of an algorithm.

is the upper bound of the growth rate of an algorithm.

None of the above.