a). Recursive function helps to solve the certain problems quite easily.i). What is meant by “Recursive Function”? [10%]ii). How it differs from “Iteration”? [10%]Questions 04Pages 04

i). A recursive function is a function that calls itself during its execution. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. All recursive functions share a common structure made up of two parts: base case and recursive case. The base case is the condition that allows the function to stop recursing, while the recursive case is the condition in which the function calls itself.

ii). The main difference between recursion and iteration is that recursion is a process, always applied to a function and iteration is applied to the set of instructions which we want to get repeatedly executed. In recursion, function calls itself until the base condition is reached. In iteration, a loop is repeatedly executed until the certain condition is met. It's also worth noting that a recursive function can be rewritten as an iterative function (and vice versa), but recursion can be more intuitive and easier to implement for problems that require deep levels of nesting, like tree-based algorithms.