In order to ensure that a recursive algorithm eventually terminates $($stops$),$ the algorithm must have at least one $\_\_\_\_\_\_\_\_\_\_\_\_.$

Question $15$ options:

base case

asymptote

recursive case

recurrence relation