The part of a recursive function that ends the recursive process is called the

a$.$ recursive step

c$.$ loop continuation condition

b$.$ b$$se case

d$.$ loop update

The part of a recursive function that continues the recursive process is called the

a$.$ recursive step

c$.$ loop continuation condition

b$.$ base case

d$.$ loop update

A recursive function usually

a$.$ runs faster than the equivalent loop

d$.$ uses the same amount of memory the

$($b$.)$ runs more slowly than the equivalent loop equivalent loop

c$.$ runs at the same speed as the equivalent loop

When a recursive function is called, the values of its arguments and its return address are placed in a

a$.$ list

c$.$ set

b$.$ dictionary

$($d$)$ stack frame