In C$++,$Given an integer, number, determine if number is a prime number. Recall

$//$ prime numbers are numbers that are divisible on by $1$ and themselves.

$//$ By definition negative values, $0$ and $1$ are not prime numbers $(2$ is

$//$ the smallest prime number$).$ If number is prime, return true,

$//$ otherwise return false.

$//$ Do not use multiple return statements or use var. Must use a loop.

$//$ Example input:

$//-3$

$//$

$//$ Expected output:

$//-$ true

static bool Test$5($int number$)$

$\{$

return false;

$\}$