1. When testing...you are verifying consistent results near critical, special or otherwise problematic input points. Final values Initial values Boundary conditions Equivalency sets. 2. The recursive method below can be described as: public static int rfibNum(int a, int b, int n) { if(n = 1) return a; if(n == 2) return b; else return rFibNum(a, b, n-1) +rFibNum(a, b, n-2); } else Head recursion Tail recursion Indirect recursion Infinite recursion 3. How many base cases are there in the recursive method below? public static int rFibNum(int a, int b, int n) { if(n == 1) return a; else if(n. 2) return b; else return rFibNum(a, b, n-1) +rFibNum(a, b, n-2); } 0 2 3 1 4. An method is called Tail Recursive if... The return statement is the last statement in the method. The return statement is not the last statement in the method. The recursive call is that last action of the method. 5. Which of the following Collection classes allows for traversing the members by their key value in a sorted order? LinkedHashset TreeMap TreeSet 6. What are the preconditions for the recursive method below? public static int rfibNum(int a, int b, int n) { if(n -- 1) return a; else if(n - 2) return b; else return rFibNum(a, b, n-1) + rFibNum(a, b, n-2); 1 n>1, a>1, b>1 n>=1 n>1 n>=1, a>=1, b>=1