False. A method that calls itself in this manner is an example of indirect recursion.
False. Recursion can be inefficient in computation because of multiple method calls and memory-space usage.
True.
False. To make recursion feasible, the recursion step in a recursive solution must resemble the original problem, but be a slightly smaller version of it.