Provide comments for these Java problems if possible.

In a class named RecursionPractice, write the static method double power(double b, int n). The method recursively returns the value of bⁿ. It should work for any reasonably small value of n, regardless of sign. Remember that b^-n= 1/bⁿ.

Within the same class, write the static method boolean isNice(int[] a). The 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.