If, in a recursive solution, function A calls function B which calls function C, this is called Indirect recursion.
A recursive algorithm is said to be recursive if such an algorithm calls itself with smaller input values and get current result for implementing basic operations on those simple inputs.
Indirect recursion occurs when a function A invokes another function B which in turn makes it the original function and calls another function C.
Learn more about recursion here:
https://brainly.com/question/3169485?referrer=searchResults
