input: Write a python function to generate a list of the first 100 prime numbers.
  assert generate_primes()[:10] == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert generate_primes()[90:100] == [463, 467, 479, 487, 491, 499, 503, 509, 521, 523]
  assert len(generate_primes()) == 100
output: def generate_primes():
      primes = []
      num = 2
      while len(primes) < 100:
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  break
          else:
              primes.append(num)
          num += 1
      return primes