Exercise 8.3 In this exercise, you will use a stack diagram to understand the execution of the following recursive method: public static void main (String args) { System . out . printIn (prod(1, 4) ) ; public static int prod(int m, int n) { if (m == n) { return n; } else { int recurse = prod (m, n - 1) ; int result = n * recurse; return result; 1. Draw a stack diagram showing the state of the program just before the last invocation of prod completes. 2. What is the output of this program? (Try to answer this question on paper first; then run the code to check your answer.) 3. Explain in a few words what prod does (without getting into the details of how it works). 4. Rewrite prod without the temporary variables recurse and result. Hint: You need only one line for the else branch