Given an integer n, return an array of all primes less than or equal to n using the Sieve of Eratosthenes.