input: Write a function to print out the first n prime numbers using the Sieve of Eratosthenes algorithm. If n is less than or equal to 0, the function should return an empty list. The function should be named sieve_of_eratosthenes.
  
  assert sieve_of_eratosthenes(10)==[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert sieve_of_eratosthenes(5)==[2, 3, 5, 7, 11]
  assert sieve_of_eratosthenes(0)==[]
  assert sieve_of_eratosthenes(1)==[2]
output: def sieve_of_eratosthenes(n):
      if n <= 0:
          return []
      limit = 55  # A rough estimate to ensure we have enough primes
      sieve = [True] * limit
      sieve[0] = sieve[1] = False
      primes = []
      for i in range(2, limit):
          if sieve[i]:
              primes.append(i)
              for j in range(i*i, limit, i):
                  sieve[j] = False
          if len(primes) == n:
              return primes