input: Write a python function to generate a list of prime numbers up to 100.
  assert generate_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]
  assert generate_primes() != [4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100]
output: def generate_primes():
      primes = []
      for num in range(2, 101):
          is_prime = True
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  is_prime = False
                  break
          if is_prime:
              primes.append(num)
      return primes