The number of recursive calls that a method goes through before returning is called: O 1. activation stack frame. 2. the depth of recursion. 3. order of growth efficiency. 4. combinatorial recursive count. 5. None of these is correct.