Given an array of ints., is it possible to divide the ints into two groups, so that the sum of one group is a multiple of 12, and the sum of the other group is odd. Every int must be in one group or the other (never in both) s

Hint: Write a recursive helper method (a method that is called from will actually do the recursion) This helper method can take whatever although no loops are allowed!

 and arguments you like, twaacouns.C[6, 6, 5]) returns true twecoR.CI5, 5, 6]) returns false twecoR.CIS, 5, 6, 1]) returns true * duascouRaLI6, 5, 6, 1]) returns false s

para t an array of integers return a boalean indicating true if there exists a non.empt subset of integers in nuns * whossum is a multiple of 12, where the sum of the remaining non empty subset of integers is odd public static boalean tueop List