I have been stumped on a question in my java class and so have my colleges. I'm asking for some pointers, because i'm lost as to where to start. Our assignment asks to take the input " positive integers along with a list of target values and determines how many subsets of the input integers, if any, sum up to each given target value."
If we have the input:

2 3 4 5

1

4

5

Our output should be:
0

1

2

I understand this, and have an idea how to do this, but i'm lost on two points.

1, we must use recursion for this, #2, we have basic code provided. All i need is some help understanding how to use the skeleton code. I want to solve it on my own. A small example using the code or a tiny fraction of what is needed will be helpful!
==========================================================================================================================================================================================================================================================

Thank you!

Code given:

```
static int subsets( int[] a, int n, int target) {

// add your code here
}

public static void main(String args[]) throws IOException {

int a[] = new int[1000];

Scanner scanner = new Scanner(System.in);
Scanner setScanner = new Scanner(scanner.nextLine());

    int n=0;
    while( setScanner.hasNextInt() ) {
    a[n] = setScanner.nextInt();
    n++;
    if(n>1000) {
        System.out.println( "Too many integers!" );
        return;
    }
    }

    while( scanner.hasNextInt() ) {
    int target = scanner.nextInt();
    System.out.println( subsets(a, n, target) );
}

}

```

}