2. true or false? if false statement, correct the statement. recursive functions: a. often fewer local variables than the equivalent nonrecursive routines. b. generally user while or for statements as their main control structures. c. are possibly only in languages with static storage allocation. d. should be used whenever execution speed is critical. e. are always shorter and clearer than the equivalent nonrecursive routines. f. must always contain a path that does not contain a recursive call. g. are always less efficient, in terms of big-o complexity.