please can someone help with this question?

Recursion HW preparation for quiz (ecs. 12-13) l. Consider the following program, which includes a recursive method: public class CSC162Recursion public static void R(int n, int if (n 0) System.out.print(t H); return; R(n-1, 3 R(n-1, 3*t+2); R(n-1, 3+1); public static void main Stringl args) R(2,0), System.out.println(); a.) Draw the tree showing the recursive calls using the box method, then write the output of the program. b) Identify the base case: recursive case c) What is the number of numbers the program would print, if the call to R in maino)were changed to R (5,2)? 2. Why is a recursive method less efficient than an iterative method