Answer: C
The given recursive function is the well-known McCarthy 91 function, defined as:
fun(x)={x−10fun(fun(x+11))if x>100if x≤100
For any integer input x≤100, this function always evaluates to 91. Let us trace the execution for x=95:
- fun(95)=fun(fun(106))=fun(96)
- fun(96)=fun(fun(107))=fun(97)
- fun(97)=fun(fun(108))=fun(98)
- fun(98)=fun(fun(109))=fun(99)
- fun(99)=fun(fun(110))=fun(100)
- fun(100)=fun(fun(111))=fun(101)=101−10=91
Thus, the function returns 91.