Which statements accurately describe the worst$-$case analysis of an algorithm? $($Select all that apply$)$

Group of answer choices

It offers a lower bound on the running time

It provides the maximum number of steps taken on any instance of a given input size

It offers a upper bound on the running time.

It guarantees the shortest possible running time for any input