An algorithm known as the Sieve of Erastosthenes can generate prime numbers.The algorithm for this procedure is presented here.Write a program that implements this algorithm. Have the program find all...

An algorithm known as the Sieve of Erastosthenes can generate prime numbers.The algorithm for this procedure is presented here.Write a program that implements this algorithm. Have the program find all prime numbers up to n = 150.What can you say about this algorithm as compared to the ones used in the text for calculating prime numbers? Step 1: Define an array of integers P. Set all elements Pi to 0, 2 <=><=> n, the algorithm terminates. Step 4: If Pi is 0, i is prime. Step 5: For all positive integer values of j, such that ij<=n,>