Question $3(12$ points$)$: Consider the following algorithm

count larr$0$

for ilarrn down to $l$

for jlarri to $n$

count larr count $+1$

end for

end while

a$)$ How many times step $4$ is executed? $($You must show your steps$)$ and what is the time

complexity of the algorithm in $-$notation?