The following algorithm returns the Boolean value true if the array has more than $z$ elements equal to $x$ and false otherwise.What are the best and worst case time complexities of this algorithm?best case is T heta$(1)$ and worst case is T heta $($N$)$none of the othersbest case is T heta $($z$)$ and worst case is T heta $($N$)$best case is T heta $($x$)$ and worst case is Theta$($z$)$best and worst cases are Theta $($N$)$