Hello Aspirant.

Hope you are doing well.

A recursive procedure is an algorithm that handles a list of items, where each item can be itself a list by decomposing the process into the handling of the first item of the list and follow this by the handling of the remainder of the list. A recursive procedure implements a process of total induction. And, when a recursive procedure gets repeated, it is called recursion. A recursive is a type of function or expression stating some concept or property of one or more variables, which is specified by a procedure that yields values or instances of that function by repeatedly applying a given relation or routine operation to known values of the function. The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function.

ALL THE BEST, STAY MOTIVATED AND HOPE THIS HELPS.

Thankyou.