Solve all the functions, please in c++

bool isPrimeA(int n)

{

complete

}

int sumPrimesA(int n)

{

return 0; complete

}

bool isPrimeB(int n)

{

complete

}

int sumPrimesB(int n)

{

return 0; complete

}

int sieveOfErathosthenes(int n)

{

complete

}

int main(){

int n = 0, k = 0, m = 0;

{

cout

cin >> n;

cout

cout

timePrimes();

}

}

(a) (10 pts) Write a function bool isPrimeA(int n) that checks the primality of n by checking whether or not n mod i = 0 for any 2