(Phython)

Implement the Sieve of Eratosthenes and use it to find all prime numbers less than or equal to one thousand.

Implement a function with the following declaration:

def sieve(l): pass

This function takes a list of integers as its argument. The list should be initialized to the values 1 through 1000. The function modifies the list so that only the prime numbers remain; all other values are zeroed out.

This function must be written to accept an integer list of any size. You program should output for all primes numbers between 1 and 1000, but when I test your function it may be on an list of a different size.

The goal here is to provide an efficient implementation. This means no multiplication, division, or modulus when determining if a number is prime.

Output for your program: All prime numbers between 1 and 1000.

DO NOT provide output or a session record for this project!

2 34 5 67 8910 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3334 35 36 37 38 39 40 41 42 4344 45 46 47 48 49 50 51 52 5354 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 7475 76 77 78 79 80 81 82 83 84 85 86 888 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 Prime numbers