Add a function int nextPrime(int n); that returns the smallest prime greater than n. For example: nextPrime(14) == 17 nextPrime(17) == 19 Change the main function to test the new code. Here is my code: #include using namespace std; bool isPrime (int n); int nextprime (int n); int main() { int n; int f; bool result; int nextprime (n); cin >> n; cout << "Please enter number: " << nextPrime; return 0; } bool isPrime (int n) //second function to check true or false { for (int f = 2; f <= n - 1; f++) if (n % f == 0) return false; if (n <= 1) return false; else return true; } int nextPrime(int n) // last function as asked in the lab { while(1) { if(isPrime(n)) //finds whether next number is prime or not { return n; } n++; } } How can I make it work?