Problem $1.($Using CLEmitter$)$ Consider the following pIsPrime. java

public class IsPrime $\{$

$//$ Entry point.

public static void main$($String $[]$ args$)\{$

int $n=$ Integer.parseInt$($args$[0])$;

boolean result $=$isPrime$(n)$;

if $($result$)\{$

System.out.println$(+"$ is a prime number"$)$;

$\}$ else $\{$

System.out.println$(+$ is not a prime number"$)$;

$\}$

$\}$

$//$ Returns true if $n$ is prime, and false otherwise.

private static boolean isPrime$($int $n)\{$

if $(n<mn\; id="EditorElement\_9144">2</mn><mi\; id="EditorElement\_9146">)</mi><mtext\; id="EditorElement\_9108"></mtext><mi\; id="EditorElement\_9109">(</mi>$

return false;

$\}$

for $($int $i=2$;$i\frac{n}{i}$;$i++)\{$

if $(n\%i==0$

return false;

$\}$

$\}$

$\}$

$\}$

${?}^1$ We recommend $/$workspace$.$rogram IsPrime.java that accepts n $($int$)$ as command$-$line argument,

and writes whether or not n is a prime number.