What is the output of the following snippet?

def fun(n):
    if (n > 100):
        return n - 5
    return fun (fun (n+11) )
print(fun(45))

1. 50
2. 100
3. 74
4. Infinite loop

What happens if the base condition isn't defined in recursive programs?

1. Program gets into an infinite loop
2. Program runs once
3. Program runs n number of times, where n is the argument given to the function
4. An exception is thrown

Assertion (A): If the arguments in a function call statement match the number and order of arguments as defined in the function definition, such arguments are called positional arguments.

Reasoning (R): During a function call, the argument list first contains default argument(s) followed by positional argument(s).

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.

Assertion (A): Local Variables are accessible only within a function or block in which they are declared.

Reasoning (R): Global variables are accessible in the whole program.

1. Both A and R are true and R is the correct explanation of A.
2. Both A and R are true but R is not the correct explanation of A.
3. A is true but R is false.
4. A is false but R is true.