can you please answer the blank parts of the question

Construct a sieve of Eratosthenes for the numbers from 2 to 100. (Write all the integers from 2 to 100. Cross out all multiples of except itself, then at the multiples of 3 except itself, then all multiples of sexcept itself, and so forth. Continue crossing out multiples of each successive prime number up to 100. The numbers that are not crossed out are the prime numbers from 2 to 100.) Use the test for primality and your sieve of Eratosthenes to determine whether the following numbers are prime 020 SIMME Test for Primality Given an integer n > 1, to test whether n is prime check to see if it is divisible by a prime number less than or equal to its square root. If it is not divisible by any of these numbers, then it is prime. (a) Let n = 6,469 How many prime numbers are less than or equal to the square root of n? Sarung is n divisible by any of these numbers? Yes NO Lali Inautery is n prime? Yes NO Schedule Chade. 1001 (b) Let n = 9,109 (c) Letn 8,663 How many prime numbers are less than or equal to the square root of n? Is n divisible by any of these numbers? O Yes No Is n prime? Yes (d) Letn 7,161 How many prime numbers are less than or equal to the square root of n