How many times is the method called in total when fact(5) is executed, taking fact(0) as the base case?

Write a recursive Java method to compute the nth term of the Fibonacci sequence, taking the first two terms as 0 and 1.

Write a recursive Java method to find the greatest common divisor of two positive integers.

Write a recursive Java method to compute the factorial of a non-negative integer n.

State two advantages and two disadvantages of recursion compared with iteration.

Write a recursive Java method to reverse a string.

Reduce F(A, B, C) = Σ(0, 1, 2, 3) using a Karnaugh map.