In C++: Develop a function to test whether a number is prime or not. The function should accept a single whole number to test and return a value of true if the number is prime, and false if it is not. Within the function, test the number's primeness by attempting to divide it by all positive integers between 2 and half of itself (e.g. divide 15 by 2,3,4,5,6,7). If any of the divisions are even (having no remainder), then the number is NOT prime. If NONE of the divisions are even, then the number IS prime. Note that negative numbers, zero, and one are NOT prime. The prototype for this function should be "bool isPrime( int x)