Which of the following python functions could be modeled by the following recursive diagram? (1 point) Responses def factorial(n): if n == 0: return 1 else: return n * factorial(n - 1) def factorial(n): if n == 0: return 1 else: return n * factorial(n - 1) def fib(n): if n <= 1: return n if n > 0: return fib(n - 1) + fib(n - 2) def fib(n): if n <= 1: return n if n > 0: return fib(n - 1) + fib(n - 2) def power(b, n): if n == 0: return 1 else: return (b * power(b, n - 1)) def power(b, n): if n == 0: return 1 else: return (b * power(b, n - 1)) def reverse(n): if len(n) == 0: return temp = n[0] reverse(n[1:]) print(temp)
1 answer
The recursive diagram best models the factorial function.