5.50 Programming Project 1: The Sieve of Eratosthenes Prime numbers are integers whose only factors are 1 and the integer itself. Algorithms for "discovering" prime numbers date to antiquity and are still relevant today in the field of cybersecurity One of the oldest algorithms for identifying primes is the "Sieve of Eratosthenes". Starting with a list of all integers greater than or equal to 2, the Sieve eliminates first all factors of 2, then all factors of 3, then all factors of 5, and so on. Each lower limit left behind is a prime number Image credit: Skoop al German Wikipedia Wikipedia shows a nicely optimized algorithm the implements the Sieve, which I present in modified form below in pseudocode (NOT python!) algorithm Sieve_of_Eratosthenes input: an integer n > 1 output: a list of all primes