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 $(23)$:

base: a$(1)=7$

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

a$.)$

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

if num $==1$:

return $7$

return recursive$\_1($num $-1)+4$

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

b$.)$

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

if num $==1$:

return $7$

return recursive$\_1($num $+1)+4$

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

c$.)$

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

if num $==1$:

return $4$

return recursive$\_1($num $-1)+7$

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

d$.)$

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

if num $==4$:

return $7$

return recursive$\_1($num $-1)+4$

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