A recursive formula can be implemented in Python and then used to provide the nth term in a series.

Which of the following recursive programs implements the recursive formula below and prints out the value of its $5$th term $(31)$:

base: a$(1)=-5$

recursion: a$($n$)=$ a$($n $-1)+9$

def recursive$\_2($num$)$:

if num $==5$:

return $-5$

return recursive$\_2($num $-1)+9$

print$(\text{'}$rec$\_2\text{'},$recursive$\_2(5))$

def recursive$\_2($num$)$:

if num $==1$:

return $-5$

return recursive$\_2($num $-1)+9$

print$(\text{'}$rec$\_2\text{'},$recursive$\_2(5))$

def recursive$\_2($num$)$:

if num $==1$:

return $9$

return recursive$\_2($num $-1)-5$

print$(\text{'}$rec$\_2\text{'},$recursive$\_2(5))$

def recursive$\_2($num$)$:

if num $==1$:

return $-5$

return recursive$\_2($num $+1)+9$

print$(\text{'}$rec$\_2\text{'},$recursive$\_2(5))$