A critical step in writing a recursive function is to assume that the

Group of answer choices

size$-$n problem has been solved by the underlying recursive mechanism.

size$-$m problem has been solved by the underlying recursive mechanism, where m $<$ n$.$

stopping condition can be identified by the underlying recursive mechanism.

size$-1$ problem has been solved by the underlying recursive mechanism.