input: Write a python function to return a list of prime numbers from 2 to 100.
  assert get_primes() == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
output: def get_primes():
      def is_prime(n):
          if n < 2:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
  
      primes = [n for n in range(2, 101) if is_prime(n)]
      return primes