Hey guys, have been struggling with a recursion homework problem. Would be very appreciative if someone could give me a nudge in the right direction, or a hint.

The Question (The algorithm has to use recursion, no loops allowed.

////////////////////////////// PROBLEM STATEMENT //////////////////////////////
// Given an array of ints, is it possible to choose a group of some of the
// ints, such that the group sums to the given target with this additional
// constraint: If a value in the array is chosen to be in the group, the
// value immediately following it in the array must not be chosen. (No loops
// needed.)
// (0, {2, 5, 10, 4}, 12) -> true
// (0, {2, 5, 10, 4}, 14) -> false
// (0, {2, 5, 10, 4}, 7) -> false
//////////////////////////////////////////////////////////////////////////////////////

Thanks guys, got some really helpful feedback last night I posted a thread!