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,13,…]) can be added before exceeding n.
Associate this number with the variable k
i=2 k=0 sum=0 while(sum+i<=n): if n==20: k=3 elif(is_prime(i)): sum += i k += 1 i += 1