$2.$ True or false? If false, correct the statement. Recursive functions:

a$.$ often have fewer local variables than the equivalent nonrecursive routines.

b$.$ generally use while or for statements as their main control structure.

c$.$ are possible 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$-0$ complexity.