In the recursive Python code below, what section of code represents the base case?

Question

def recursion(k):
if(k > 0):
result = k + recursion(k - 1)
else:
result = 0
return result

recursion(4)
(1 point)
Responses

if(k > 0):
result = k + recursion(k - 1)
if(k > 0): result = k + recursion(k - 1)

recursion(4)
recursion(4)

else:
result = 0
else: result = 0

def recursion(k):

Answer 1

In the provided recursive Python code, the section that represents the base case is:

else:
    result = 0

The base case is the condition that stops the recursion from continuing indefinitely. In this case, when k is not greater than 0, the recursion terminates by returning 0.