Create Python 3 code that satisfies the conditions below:

def sum_primes(start, end):

"""sum_primes. This function must return the sum of the prime numbers between start and end, inclusive of both. If there are no prime numbers found, including because end <= start, return 0.

Parameters:

start (int): A positive integer, which may or may not be a prime number.

end (int): A positive integer, which may or may not be a prime number.

Returns:

n (int): An integer that is the sum of the prime numbers between start and end, inclusive of both.

"""

return

Test cases:

print('sum_primes') test(sum_primes(10, 1), 0) test(sum_primes(0, 0), 0) test(sum_primes(1, 2), 2) test(sum_primes(1, 10), 17) test(sum_primes(20, 40), 120) test(sum_primes(1701, 7420), 3022419)