Consider an algorithm for some problem. Suppose there is an infinite subset of inputs whose size is parameterized by n that makes the algorithm run in 100n + 1 elementary O(1) operations, for every n > 10. We can say that Choose one:

Worst case running time of the algorithm is linear (n),

Best case running time of the algorithm is (n),

Best case running time of the algorithm is at most (n),

None of the above