Question $5$

$1$ pts

Suppose you can prove that program $A$ is $(n)$ and program $B$ is $(n^2).$ Which of the following is necessarily true if you run both programs on the same input?

We don't know anything about how program A$\text{'}$s and B$\text{'}$s runtime will compare

Program A runs faster than program $B$ on sufficiently large inputs

Program A runs faster than program B on small inputs

Program A runs faster than program B on all inputs