Please submit code in PYTHON language, thanks

P#1. Sieve of Eratosthenes. Popular algorithms to Position Primes find primes are either Sieve of Eratosthenes or Trial Division. Most of you in the CP# 1 used the Trial 1 2 Division algorithm. The objective of the current program is to implement an old algorithm, the Sieve of Eratosthenes. Primes are positive integers which have no other divisors except 1 and itself. When a 3 4 7 number has more than two factors it is called a composite number. The program will create the array of prime numbers less than N in ascending order and print them. [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, …N. Answer should contain a table of the prime numbers less than N and the specified position in the prime array <N Test the program with N-100. Program prints also how many primes are in the range of 2 to N Hint: each time you find a multiple of each picked number in the initial list [1:n], make it zero. Elements not equal to zero are primes. This works a lot better than trying to ‘erase’ the element. Because each time you erase an element the remaining indexes roll over, i.e., they change. Show transcribed image text P#1. Sieve of Eratosthenes. Popular algorithms to Position Primes find primes are either Sieve of Eratosthenes or Trial Division. Most of you in the CP# 1 used the Trial 1 2 Division algorithm. The objective of the current program is to implement an old algorithm, the Sieve of Eratosthenes. Primes are positive integers which have no other divisors except 1 and itself. When a 3 4 7 number has more than two factors it is called a composite number. The program will create the array of prime numbers less than N in ascending order and print them. [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, …N. Answer should contain a table of the prime numbers less than N and the specified position in the prime array

## Expert Answer

Answer to P#1. Sieve of Eratosthenes. Popular algorithms to Position Primes find primes are either Sieve of Eratosthenes or Trial …