For the following recursive method I. Identify the base case, when does this occur? (2 points) 2. Identify the general (recursive) case, when does this occur? (2 points) 3. Are there any constraints on the integer value passed in? (1 point) 4. Trace the code using the box method and state what the result is for the call int result = recur(25); (You must show the trace to receive full credit.) (45 points) public static int recur(int n) if(n . For example, values point to a list containing 3, 5, 5, 9, 15, 17, 20, 22, 25, and 27 a.) Write a recursive method sumDivFive(LLNode Integer> list) that returns the sum of all the numbers contained in the list that are evenly divisible by 5. For our example list, the call int result sumDivFive(values); would return 70 (the sum of the numbers 5, 5, 15, 20, and 25). (50 points)