Write functions that is a recursive version of following two functions: 1). int
ID: 3743389 • Letter: W
Question
Write functions that is a recursive version of following two functions:
1).
int checkPrimeNumber(int number) {
bool num = false;
int i=2;
while (i <= number/2) {
if (number%i == 0) {
num = true;
break;
}
++i;
}
return num;
}
2).
void multiplicationTable(int number) {
for(int i=1; i<=12; i++) {
cout<< " " <<number<< " * " << i << " = "<< i * number << endl;
}
}