A problem can be solved with recursion if it can be broken down into successive smaller problems that are the same as the overall problem.

True or False.

Answer: True

Explanation: Recursion is a problem solving techniques which gives the solution for any particular problem by splitting the problem into smaller section and then working on it.

Solving of any problem becomes easier through this method and that's why it gets supports from many programming languages. Thus is the function that gets invoked in the program by calling it itself. Thus, the statement given is true.