Draw Stacks (Activation Record Instance) for returns from the below programint recursion(int m, int n, int i, int j){ static int sum = 0; if (m == n) { sum += pow(i*j,2); return sum; } else { sum += pow(i*j,2); return recursion(m+1, n, i+1, j+1); } } void main(){ printf("sum= %d\n", recursion(1,5,2,3)); }

In java if i have this pseudo code that tries to explain how a method will work using recursion how can i turn this into working java code

Do not use static variables to implement recursive methods.  USING JAVA What is the worst case runtime complexity of the following code in terms of n for (int pass = 1; pass <= n; pass++) { for (int index = 0; index < n; index++) { for (int count = 1; count < 10; count++) { // constant time operation } // end for } // end for } // end

JavaNeed the bottom half answered.