### Question:
RecursionExample { public int fibonacci(int n){ if (n <=1 ){ return n; } return fibonacci(n-1) + fibonacci(n-2); }  int sum(int n); int tailSum(int currentSum, int n); int iterativeSum(int n); int powerOf10(int n); int fibonacci(int n); String toBinary(int n); int calculateTreeHeight(BinaryNode root); int max(int a,int b);  }### Answer:
@Test public void testFibonacci() { int n0 = recursion.fibonacci(0); int n1 = recursion.fibonacci(1); int n7 = recursion.fibonacci(7); Assert.assertEquals(0, n0); Assert.assertEquals(1, n1); Assert.assertEquals(13, n7); }