algorithms & data structures-1

answer and explain briefly .

4. For the following recursive function, findf (5): int f(int n) if (n 0) return 0; else return n f(n - 1)