A prime number is a whole number greater than $1,$ which is divisible only by $1$ and itself. Some examples of prime numbers are: $2,3,5,7,11,13,...$ Define a method named isPrime. It should have one parameter, an int, and should return a boolean $$ true if the parameter is a prime number.

$**$ @return true only if $x$ is prime

$*$@param $x$ is positive

$*/$

public boolean isPrime $($int x$)$

Test your method with the following numbers

$2($prime$)$

$13($prime$)$

$169($not prime$)$

$277($prime$)$

$300($not prime$)$