What is the space complexity using Big O notation? Try to justify your answer.

def recursive$\_$function$($n$)$: if n $==0$: return

print $($n$)$

recursive$\_$function $($n$-1)$

recursive$\_$function$($n$-1)$

print$("$rf$("+$ str$($n$)+")$ finished"$)$

recursive$\_$function$(3)$