Consider the following recursive method: int recursion (int n) { if (n == 0) return 2: else if (n == 1) return 3: else return recursion(n - 1) + recursion (n - 2): } What is the output for each of the following statements? a. System.out.println ("Call for n = 2 returns "+ recursion (2)): b. System_.out. println ("Call for n = 3 returns "+ recursion (3)): c. System_.out. println ("Call for n = 5 returns "+ recursion (5)): Create a recursive method to generate the Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21