Find the complexity of the algorithm as Big $O$ notation:

countValue$($a$,$ n$,$ val$)$

i

count $=0$

for $i=1$ to

if $)=(val$

count $=$ count $+1$

;

return count

;