Algorithm Count$($n$)$

$//$ Input: A positive integer n$.$

i $2$

while $($i $<$ n$)$ do

i $$ i$2$

x $$ x $+1$

return i

What does this algorithm compute when you call Count$($n$)?$ Your answer should be a function of n$.$ Show all your work without skipping any steps.

b$.$ Find a Theta $(\backslash$theta $)$ notation for the number of times the statement x $=$ x $+1$ is executed.