What is the running time of the following algorithm $($in the worst case$)$ expressed in terms of n$?$

for i $1$ to n

do if A$[$i$]=$ x

then return i

elseif A$[$i$]<$ x

then i i $+1$

else return $$x not found$$

return $$x not found$$

Question $7$Select one:

a$.$

T$($n$)=$ n

b$.$

T$($n$)=$ n log n

c$.$

T$($n$)=2$n

d$.$

T$($n$)=$ n$2$