#JAVA

Write the recursive method for all given recursive definition below, compute the returned value when the method is executed and show all the steps for example in table 1.0, table 2.0 and table 3.0 below. You can use any suitable value to test your method. 3 if n 1 s(n) = { n - S(n/2) if n > 1 Table 1.0: Recursive Definition public static int s( int n) if( n == 1) return 3; else if (n>1) return n- s (n/2) } Table 2.0: Recursive Method S (9): return 9- S (4) --> 9 - 5 S (4): return 4 -S (2) --> 4-(-1) =5 S (2): return 2 -S (1) --> 2-3 = -1 Therefore s (9): return 4. Value return is 4. S (1): return 3. Value return is 3. Table 3.0: Compute the returned value 1. Write a recursive method, power, that takes as parameters two integers x and y such that x is nonzero and returns xy. If y > 0: power(x, y) = 1 if y=0 if y= 1 X* power(x, y - 1) if y > 1 If y