Problem $2$: Finish writing the following function to test if the integer $n$ is prime.

$($Recall a prime number is a number that is only evenly divisible by itself and $1.)$ We assume that the integer is at least $2,$ and return False otherwise.

Q Answer that will be automatically graded below, ID: e$262$a$9$

In $[]$: def is prime$(n)$: # Tests whether the integer $n$ is a prime number. Returns True if it is a prime number and False if it is not $($or is less than $2.)$

if $n<mn\; id="EditorElement\_5004323">2</mn>$ : return False

for $d$ in $2$dotsn$-1$ :