Build the  generator primes() function so that you fills the n one at a time, and comes back to primes() function until n > 100.

Sure, here is a Python function that generates prime numbers one at a time until n > 100:

def primes():
    n = 2
    while n <= 100:
        if all(n % i for i in range(2, n)):
            yield n
        n += 1

Here's how it works:

1. The function starts with n = 2, the smallest prime number.
2. The while loop continues as long as n <= 100.
3. The if statement checks if n is a prime number. It does this by checking if n is not divisible by any number in the range from 2 to n. If n is not divisible by any of these numbers, it is a prime number.
4. If n is a prime number, the yield statement produces it as the next value from the generator.
5. After yielding n, the function increments n by 1 and the while loop continues.

You can use this generator in a for loop like this:

for prime in primes():
    print(prime)

This will print all prime numbers from 2 to 100, one at a time.