def sum$\_$digits$($y$)$:

$"""$Return the sum of the digits of non$-$negative integer y$."""$

total $=0$

while y $>0$:

total, y $=$ total $+$ y $\%10,$ y $//10$

return total

def is$\_$prime$($n$)$:

$"""$Return whether positive integer n is prime."""

if n $==1$:

return False

k $=2$

while k $<$ n:

if n $\%$ k $==0$:

return False

k $+=1$

return True

def count$\_$cond$($condition$)$:

$"""$Returns a function with one parameter N that counts all the numbers from

$1$ to N that satisfy the two$-$argument predicate function Condition, where

the first argument for Condition is N and the second argument is the

number from $1$ to N$.$

$>>>$ count$\_$fives $=$ count$\_$cond$($lambda n$,$ i: sum$\_$digits$($n $*$ i$)==5)$

$>>>$ count$\_$fives$(10)$ # $50(10*5)$

$1$

$>>>$ count$\_$fives$(50)$ # $50(50*1),500(50*10),1400(50*28),2300(50*46)$

$4$

$>>>$ is$\_$i$\_$prime $=$ lambda n$,$ i: is$\_$prime$($i$)$ # need to pass $2-$argument function into count$\_$cond

$>>>$ count$\_$primes $=$ count$\_$cond$($is$\_$i$\_$prime$)$

$>>>$ count$\_$primes$(2)$ # $2$

$1$

$>>>$ count$\_$primes$(3)$ # $2,3$

$2$

$>>>$ count$\_$primes$(4)$ # $2,3$

$2$

$>>>$ count$\_$primes$(5)$ # $2,3,5$

$3$

$>>>$ count$\_$primes$(20)$ # $2,3,5,7,11,13,17,19$

$8$

$"""$

$"***$ YOUR CODE HERE $***"$