a critical step in writing a recursive function is to assume that the group of answer choices size-m problem has been solved by the underlying recursive mechanism, where m < n. size-1 problem has been solved by the underlying recursive mechanism. stopping condition can be identified by the underlying recursive mechanism. size-n problem has been solved by the underlying recursive mechanism.