Consider the following algorithm:

ALGORITHM Count $($A$[0..$n $-1])$

$//$: $[0..1]$

$//$: $[0..1]$

$01$

$11$

$[]<[]$

$[][]+1$

$[..]$

a$.(2$ points$)$ What does this algorithm compute?

b$.(2$ points$)$ Considering space efficiency, is this $$in space$$ or $$out of space$?$ Why?

c$.(2$ points$)$ What is the input size?

d$.(2$ points$)$ What is the basic operation?

e$.(5$ points$)$ How many time the basic operation executed $($aka what is $())?$

f$.(2$ points$)$ What is the efficiency class of this algorithm? Indicate the class

$\backslash$Theta $(())$ the function belongs to$.($Use the simplest $()$ possible in your

answers.$)$