Provide answers by analyzing the following code: public class Exampleproblem \{ public static int multiplydigits(int n ) if (n==) return 1; else \} public static void main(String[] args) int num =44; int result = multiplyDigits(num); System.out.println(result); 3 3 1) How many arguments/parameters the recursive function takes? 2) Write the base case and briefly explain its logic. 3) Write the recursive function call statement and briefly explain its lo 4) How many total steps are present for function call of 'num(44)