Why do we consider the worst$-$case running time when analyzing the time complexity of an

algorithm? $($select all that apply$)$

The worst$-$case scenario is easier to calculate than the average$-$case scenario.

We don't, we always consider the average case running time.

Considering the worst$-$case time complexity of an algorithm helps us ensure that the algorithm will

always perform efficiently regardless of the input.

The worst$-$case scenario is usually the same as the average$-$case scenario.

The worst$-$case running time always reflects the actual running time of the algorithm.

The worst$-$case scenario helps in understanding the upper bound on the running time.