Examine the code below. Determine the missing line of code so that the function primes$($N$)$ uses the function divisors$($n$)$ to return a list of all the prime numbers less than or equal to some positive integer N$.$

def divisors$($n$)$:

D$=[]$

for i in range$(1,$n$+1)$:

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

D$.$append$($i$)$

return D

def primes$($N$)$:

P$=[]$

for i in range$(1,$N$+1)$:

## MISSING LINE IS HERE

P$.$append$($i$)$

return P