algorithms & data structures-1 ignore find f (5) answer and explain briefly .

idly than a recursive funeO int f(int n) if (n 0) 3 A nonreeul For the following recursive function, find f(5): return 0; else return n + f(n 1); 5. For the function in Question 4, find f(0) 6. For the function in Question 4, suppose +is changed to *in the inductive case. Find f(5). 7. For the function in Question 4, what happens with the function call f(-1)