1. Write a recursive Java method that can find the n-th power of two (2). The prototype should be: public int powerOfTwo (int n); 2. What is the value of f(3) ? (trace the code and write down the steps: do not run the code in Eclipse) public static int f(int n) { if (n 4) == return n; else return 2* f (n+1); } 3. What is the value off (3,5)? (trace the code and write down the steps; do not run the code in Eclipse) public static int f(int x, int y) { if (x 0) return y; == return f(x - 1, x + y); } Put your Java code and answers in a Word file and submit