Write a recursive Java method for computing 2 n for a positive integer n. First state the base case and the sub-problem for the recursive algorithm and then write the Java code for a method to solve the problem. The method could be invoked using a statement such as the one below:

System.out.print("2^n = " + power2(5));