he Greek mathematician Eratosthenes came up with the idea of using a sieve algorithm to find prime numbers. True False 2 To be sure it has found all possible prime numbers up to a certain number N, the prime sieve program repeats the sieve algorithm for all values up to N. True False 3 The prime sieve program uses a list of integers and sets the value to 0 when a number is determined not to be prime. True False 4 What list of prime values is produced if the prime_sieve program is executed with an input value of 20