Exercise 2.2: The sieve of Eratosthenes

---

The sieve of Eratosthenes is a method for computing prime numbers. Read about it on Wikipedia. Based on the pseudocode, write a Python code to make a list of all primes less than 10,000. How many are there? (When you answer this question, you’ll see the curious result that the number of primes less than 10,000 is also prime!)