Problem 1 int main(int argc, char *argv[]) {int n = atoi(argv[1]); int factorial_n = factorial(n); cout << "factorial = " << factorial_n << " ";} Write a recursive implementation of the factorial function needed above. Non-positive values of n should be returned as is. That is, factorial(5) = 120 while factorial(-5) = -5. Problem 2 void magic(const char *c) {if (!(*c))return;magic(c+1); cout << *c;} int main(int argc, char *argv[]) { char text[80];while (cin.getline(text, 80)) {magic(text); cout << " ";}} Determine what the above code writes to stdoutgiven the following input: nspx mbufn zn fub mxp sngmf fupnfs fn pu ffmgzpc bobobc pznbshfmfu tibsbt fft ibspo tufm fhsbn