The Sieve of Eratosthenes is an ancient method of determining all the primes up to a given number. To find all the prime numbers less than or equal to a given integer n by Eratosthenes' method: 1. Create a list of consecutive integers from 2 through n: (2, 3, 4, ..., n). 2. Initially, let p equal 2, the smallest prime number. 3. Enumerate the multiples of p by counting to n from 2p in increments of p, and mark them in the list (these will be 2p, 3p, 4p, ...; the p itself should not be marked). 4. Increase the value of p by 1. Repeat from step 3. 5. Continue until p = n. The numbers remaining not marked in the list are all the primes below n. The main idea here is that every value given to p will be prime, because if it were composite it would be marked as a multiple of some other, smaller prime. Note that some of the numbers may be marked more than once (e.g., 15 will be marked both for 3 and 5). Please write a Python code which implements this approach. Your program should as the user for a value for n, and should output the primes less than or equal to n. Hint 1: Use nested loops Hint 2: The input function returns a string you need to convert it to an integer using the int function.