$(10$ points$)$ Consider the following algorithm:

for $(\}$i$=1$;in;i$++$

j$\}=\backslash$underline$\{$n;

while $($j$>=1)\{$

cout $$ i j$$ endl;

$\}$

j $=\backslash$lfloor $\backslash /2\backslash$rfloor;

$\}$

a$)$ What is the output when $n=2,n=4,n=8?$

b$)$ What is the time complexity function $T(n)$ of the algorithm if the basic operation is cout? You may

assume that the input n is a power of $2.$

$(10$ points$)$ Consider the following algorithm:

a$)$ What is the output when $n=2,n=4,n=8?$

b$)$ What is the time complexity function $T(n)$ of the algorithm if the basic operation is cout? You may

assume that the input $n$ is a power of $2.$

c$)$ What order of complexity does the algorithm's time complexity function belong to$?$