In recursive methods, if a temporary variable is used to store intermediate results, how many copies of that variable will exist from the first call to the last one when the recursion finishes?

In recursive methods, if a temporary variable is used to store intermediate results, then number of copies it will make is equal to recursive calls made during recursions

Explanation:

If a temporary variable is used to store intermediate result than  it make a new copy every time when the recursive method calls itself until the last recursive call. So for that recursive methods are not storage efficient because they  push and pop results of each call on memory.

the answer is a

you welcome

answer; (value inventories) are questionaires that you determine your personal values so that you can find a career that's in line with what you hold important;