Java problems

Problem 1 (3 points): Fill in the blanks to implement a recursive function to determine if a given integer 'n' is a power of 2. For example isPowerofTwo (n) true for n 1,2,4, 8,16 isPowerofTwo (n) -> false for all the other numbers Assume that the parameter n is always a positive number (n>0). Design a recursive way to solve the problem. Hint: if n is a power of 2, then it must be true that n/2 is also a power of 2. public static boolean isPowerofTwo (int n) if ( return else return n%2-0 &&