Both are in java

1. Rewrite the following Java method in a functionally equivalent way that does not use any recursion void f(int n) System.out.println(n); if (n > 1) if ((n & 1) ## e) else f(3 n+1); f(n/2); 2. Rewrite the following Java method in a functionally equivalent way that does not use any loop. int f(int[] a, int k) { int i = -1; for (int j 0; j