question: uses `` backtracking '' through recursion to determine if the `` target '' a positive integer can be computed as the result of summing any combination of integers in the arrayofintegers . note : make no assumptions about what is included in the array of integer , except that each integer in the array may be used only once . for example : summable 10 , 1,2,3,4,5 is true , but summable 20 , 1,2,3,4,5 is not . by way of a hint : you will most certainly want to define an `` auxiliary '' method private static that manages the array indexing for you . concode_field_sep int divisions concode_field_sep int fibonacci concode_elem_sep boolean primeHelper concode_elem_sep int pmod concode_elem_sep int gcd concode_elem_sep void main concode_elem_sep double refine concode_elem_sep boolean summable concode_elem_sep int mystery concode_elem_sep double sqrt concode_elem_sep double sqrt_aux concode_elem_sep int power concode_elem_sep boolean near concode_elem_sep boolean isPrime concode_elem_sep int gcdHelper
target: boolean function ( int arg0 , int [ ] arg1 , int arg2 , int arg3 ) { if ( arg3 == arg0 ) { return true ; } if ( arg2 == arg1 . length ) { return false ; } else { return ( summableHelper ( arg0 , arg1 , arg2 + 1 , arg3 + arg1 [ arg2 ] ) || summableHelper ( arg0 , arg1 , arg2 + 1 , arg3 ) ) ; } }