I have an algorithm that performs comparisons on data. I have carefully analyzed the entire algorithm and discovered that in the worst case, it runs through all the loops as many times as possible. When this happens, the algorithm will always perform $8$n $-10$ comparisons for any input of size n$.$ What true statements can I make at this point about the overall running time of this algorithm $($even if those statements do not represent a tight bound$)?$ Select all that apply.

Question $2$ options:

A$)$

The overall running time of this algorithm is O$($n$).$

B$)$

The best$-$case running time of the algorithm is $\backslash$Omega $($n$)$

C$)$

The best$-$case running time of the algorithm is $\backslash$Omega $(1)$

D$)$

The best$-$case running time of this algorithm is O$($n$)$

E$)$

The worst$-$case running time of this algorithm is $\backslash$theta $($n$)$