Determine which characteristics of an algorithm described

in the text (after Algorithm 1) the following procedures

have and which they lack.

procedure double(n: positive integer)

while n > 0

n := 2n
a. Input
b. Output
c. Definiteness
d. Finiteness
e. Effectiveness
f. Generality