A strange function. Consider McCarthy’s 91 function:

public static int mcCarthy(int n)

{

if (n > 100) return n - 10;

return mcCarthy(mcCarthy(n+11));

}

Determine the value of mcCarthy(50) without using a computer. Give the number of recursive calls used by mcCarthy() to compute this result. Prove that the base case is reached for all positive integers n or find a value of n for which this function goes into an infinite recursive loop.