Implement a recursive function to determine if a number is prime. Skeletal code is provided in the IsPrime function.

#include

using namespace std;

// Returns 0 if value is not prime, 1 if value is prime

int IsPrime(int testVal, int divVal)

{

// Base case 1: 0 and 1 are not prime, testVal is not prime

// Base case 2: testVal only divisible by 1, testVal is prime

// Recursive Case

// Check if testVal can be evenly divided by divVal

// Hint: use the % operator

// If not, recursive call to isPrime with testVal and (divVal - 1)

return 0;

}

int main(){

int primeCheckVal = 0; // Value checked for prime

// Check primes for values 1 to 10

for (primeCheckVal = 1; primeCheckVal <= 10; ++primeCheckVal) {

if (IsPrime(primeCheckVal, (primeCheckVal - 1)) == 1) {

cout << primeCheckVal << " is prime." << endl;

}

else {

cout << primeCheckVal << " is not prime." << endl;

}

}

}