Question $4$

$O(1)$ is considered polynomial time.

True

False

Question $5$

If the best case of an algorithm is calculated as $5n+6,$ what is a possible worst case for that algorithm?

$4n+2$

$3n-7$

$(3)10n+1$

None of the above