Write a for-loop method in Java that has the time complexity of O(2^n) without using Math.pow(2,n). For example, the for-loop method for O(n^2) would be something like this:

int count = 0;

for(int i=0; i

for(int j=0; j

System.out.println("Output: "+count);

count++;

}

}