Assume the availability of a function is_prime . assume a variable n has been associated with positive integer. write the statements needed to find out how many prime numbers (starting with 2 and going in increasing order with successively higher primes [2,3,5,7,11,) can be added before exceeding n . associate this number with the variable k .
this is my code
def k(n):
sum = 0
k=2
while sum < = n:
if is_prime(k):
sum +=k
if sum < = n:
k+= 1