writing a prime number generator in python which returns ALL prime numbers (not just those in a given interval/range) and passes all of the given tests.

Write a prime number generator Write a generator that returns all the prime numbers. The idea is to loop over all positive integers, test each one to see if it is prime, and if it is, yield it Hef prime_number_generator(): "This generator returns all prime numbers." # YOUR CODE HERE 0 ## Here you can test your code. ## What you write here will be removed. [] ## visible tests: 5 points initial_primes = [2, 3, 5, 7, 11, 13, 17, 19, 23] idx = @ for p in prime_number_generator(): assert p == initial_primes[idx] idx += 1 if idx == len(initial_primes): break [] ## Hidden tests: 10 points # We test that the generator goes on and on and on