this is discrete math $2$

Describe the worst$-$case time complexity, measured in terms of comparisons, for this following

algorithm that finds all modes in a list of nondecreasing integers.

Procedure find all modes $\{\begin{array}{c}{a}_1\\ a_2\\ \text{d}\text{o}\text{t}\text{s}\\ a_n\end{array}$ : nondecreasing integers