This algorithm was made to find a solution to the problem of finding all prime numbers less than a given integer.

procedure findPrimes$($i: integer$)$

num :$=1$

while$($num $<$ i$)$

See if num is a prime number.

if num is a prime number, add num to a prime number set

otherwise, num :$=$ num $+1$

return prime number set

Which property does this algorithm lack?

Group of answer choices

Definiteness

Finiteness

Input

Generality

Output