Recursion is most useful when a problem can be solved by repeatedly solving simpler versions of the same problem. Identify the incorrect statemen

a$.$ Often, a recursive method has just one base case, but sometimes it has more.

b$.$ The cases in a recursive method that make recursive calls are recursive cases.

c$.$ The case in a recursive method that does not make a recursive call is the base case.

d$.$ Programs that use recursion usually run more slowly than those that do not because the repeated method calls require overhead.