Exercise: Implement the Sieve of Eratosthenes

Problem statement

In this challenge, you’ll be given a positive integer $n$ greater than $1$, and you’ll count the number of prime numbersA prime number is an integer greater than 1 that is divisible only by 1 and itself. in the range $2$ to $n$.