Suppose we know that an algorithm called on an input of size $n$ has a runtime $R(n).$ We know

that $R(n)$ is quadratic in $n$ for the worst case input, and linear in $n$ for the best case input.

Check all of the true statements below.

A$.R(n)inO(n)$

B$.R(n)inO(n^2)$

C$.R(n)inO(n^3)$

D$.R(n)in(n)$

E$.R(n)in(n^2)$

F$.R(n)in(n^3)$

G$.R(n)in(n)$

H$.R(n)in(n^2)$

I.

J$.$ The size of the worst case input is larger than the size of the best case input.

K$.$ For sufficiently large $n,$ the running time of the algorithm is greater when run on the worst

case input than when run on the best case input.