input: Write a function to find the possible prime numbers from one to one hundred by using the Sieve of Eratosthenes algorithm.
  def sieve_eratosthenes(n): 
      prime_list = [True] * (n+1) 
      prime_list[0] = False
      prime_list[1] = False
      primes = [] 
        
      for i in range(2, n+1): 
          if prime_list[i] == True: 
              primes.append(i) 
              for j in range(i*i, n+1, i): 
                  prime_list[j] = False
      return primes 
    
  n = 100
  print("The Prime numbers from 1 to 100 are:")
  print(sieve_eratosthenes(n)) 
  assert sieve_eratosthenes(10) == [2, 3, 5, 7]
  assert sieve_eratosthenes(20) == [2, 3, 5, 7, 11, 13, 17, 19]
  assert sieve_eratosthenes(0) == []
  assert sieve_eratosthenes(1) == []
output: def sieve_eratosthenes(n): 
      prime_list = [True] * (n+1) 
      prime_list[0] = False
      prime_list[1] = False
      primes = [] 
        
      for i in range(2, n+1): 
          if prime_list[i] == True: 
              primes.append(i) 
              for j in range(i*i, n+1, i): 
                  prime_list[j] = False
      return primes