Determine which characteristics of an algorithm de$-$

b$)$ procedure divide$(n$ : positive integer$)$

while $n0$

$m$:$=\frac{1}{n}$

$n$:$=n-1$

scribed in the text $($after Algorithm $1)$ the following pro$-$

c$)$ procedure : positive integer$)$

cedures have and which they lack.

a$)$ procedure double$(n$ : positive integer$)$

sum :$=0$

while $i<mn>1</mn><mn>0</mn>$

sum :$={\displaystyle \underset{?}{\overset{?}{}}}+i$

while $n>0$

d$)$ procedure choose$(a,b$ : integers$)$

$n$:$=2n$

$x$:$=$ either $a$ or $b$