What is the difference between knowing an algorithm has worst-case running time O(n) and knowing an algorithm has worst-case running time (n)? Mark all valid answers.

Group of answer choices

For (n), we know that there is an infinite family of instances on which the algorithm takes at least cn steps for some constant c > 0, whereas if we only know O(n) we may not know this

There could be no diffference; you may just not yet know that the O(n) algorithm also has worst-case running time Omega(n)

(n) defines the best case, so that algorithm may run slower than the other in some scenarios.

O(n) describes the worst case, so that algorithm may run faster than the other in some scenarios.

What is the difference between knowing an algorithm has worst-case running time O(n) and knowing an algorithm has worst-case running time (n)? Mark all valid answers. For O(n), we know that there is an infinite family of instances on which the algorithm takes at least cn steps for some constant c> 0, whereas if we only know O(n) we may not know this There could be no diffference, you may just not yet know that the O(n) algorithm also has worst-case running time Omega(n) (n) defines the best case, so that algorithm may run slower than the other in some scenarios. O(n) describes the worst case, so that algorithm may run faster than the other in some scenarios