answer step by step

Question 1: Tracing Recursive functions Refer to "Unit 9 Recursion Lecture Slides" for Tracing examples. The solution should be handwritten in a paper and upload the pictures of solution to a PDF file. a) Trace the following recursive method for the function call "multiplyDigits(58746)" and show the output result (6 Points) public static int multiplydigits(int n ) \{ if (n==0) return 1; else return ((n%10) multiplyDigits (n/10)); \} Answer the following questions: 1) Which line(s) of this program define(s) the base case of method? 2) Which line(s) of this program include recursive call(s)? 3) At what step of your recursion tracing did you hit the base case? 4) What is the final output of this code