How does a programmer avoid an infinite loop condition when writing a recursive algorithm?

Select one

A$.$ Include a stop condition check before proceeding to the recursive call.

B$.$ Use an upper limit on the for loop that is small enough to avoid running out of memory.

C$.$ Test for as many possible inputs as possible when running the code,

D$.$ Provide the user with instructions for acceptable input values.