Need help with the java problem.

LAB 1c: Formula [ Formula3.java ] 25 points. Write a method called power30 that takes a single integer parameter that is greater than or equal to 0, an calculates x" by using the following recursive formula: X 1 xn = x * xn-1, if n > 0 power30 is to be a recursive method. Note that you cannot use Math.pow in your solution to this recursi 0 method. Hint: In a way similar to taking the recursive formula for factorial: 01=1 1: = 1 n: = n * (n-1) and rewriting it as: factorial(O) 0 factorial(1)- 1 factorial(3) = 3 * factorial(2) = 3 * 2-6 factorial(4) = 4 * factorial(3) = 4 * 6 = 24 factorial(5)-5 * factorial(4-5 * 24-120