Recursion

1. Trace (hand-written or typed) the following three recursive methods and identify the base case for a,b, and c:

a. public int mystery (int n) { // n = 5 if (n==0) return 1; else return 10 - mystery (n - 1); }

b. public int mystery (int n) { // n = 7 if (n==0) return 1; else return 2 * mystery (n - 1); }

c. public int mystery (int n) { // n = 4 if (n==0) return 0; else return 2 + mystery (n - 1); }