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 its $5$th term $(-8)$:

base: a$(1)=12$

recursion: a$($n$)=$ a$($n $-1)-5$

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

if num $==12$:

return $12$

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

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

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

if num $==1$:

return $-5$

return recursive$\_3($num $-1)+12$

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

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

if num $==1$:

return $12$

return recursive$\_3($num $+1)-5$

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

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

if num $==1$:

return $12$

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

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