Python Problem:

- Problem 4: Prime Number Generation Recall that a prime number is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. For this problem, you will implement a prime number generator. The idea is to loop over all positive integers, test each one to see if it is prime, and if it is, yield it. My solution is simple and not particularly optimized, and it is 12 lines long. [] def prime_number_generator(): "" "This generator returns all prime numbers. """ # YOUR CODE HERE raise NotImplementedError() Once prime_number_generator is implemented, the below code should print the first 10 primes, starting with 2. [] i = 0 for n in prime_number_generator(): print(n) i += 1 if i == 10: break [ ] ### Tests for "prime_number_generator for n in prime_number_generator(): if n == 33: raise Exception() elif n == 37: break