In java please with usage of recursive and if possible with notes! Thank you.

Within a source file named RecursionPractice.java, write the static method double power(double b, int n) This method recursively returns the value of b^n. It should work for any reasonably small value of n, regardless of sign.

Remember that b^n = 1/b^n. You can use the recursive power method we wrote in class as a starting point.

Within RecursionPractice.java, write the static method boolean isNice(int[] a) This method recursively returns whether the array a is nice. Well define an array as being nice if all of its elements are divisible by either 3 or 4 (or both).

For example, {12, -9} is nice, but {15, 55, 10} is not nice. The empty array (i.e., the array with length 0) is not considered nice. Include a helper method if needed.