$[$Q$6$ MC$]$In the worst case, the time efficiency class of algorithm in terms of "BIG$-$O$"$ notation is:

a$.O(n)$

b$.$ None of the answers

c$.O(1)$

d$.O(n^{{?}^{{?}^{?}}}2)$

e$.O(logn)$

Clear my choice