$5$x$3+3$x$+6$ can be described as being in

$10$ points

$(3)$

$()$

none of the other answers

$(2)$

$(4)$

function X$($A$,$N$,$x$,$z$)$

count$=0$

for $0<=$ i $<$ N

if$($A$[$i$]==$x$)$

count$=$count$+1$

if$($count$>$z$)$

return true

return false

end function

What are the best and worst case time complexities of this algorithm?

a$.$ best case is $()$ and worst case is $()$

b$.$ best and worst cases are $()$

c$.$ best case is $(1)$ and worst case is $()$

d$.$ none of the others

e$.$ best case is $()$ and worst case is $()$