Complete this codeYou can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops./** * Decide if it is possible to divide the integers in a list into two sets, * so that the sum of one set is odd, and the sum of the other set is a multiple of 10. * Every integer must be in one set or the other. * For example, oddAndTen([5, 5, 3]) → true, * and oddAndTen([5, 5, 4]) → false. * @param list is a list of integers. * @return true iff there is one odd partition and the other multiple of 10. */public static boolean oddAndTen(List<Integer> list) { // call your recursive helper method return ...}private static boolean oddAndTenHelper(...) { // add any parameters // base case // recursive step} Given a list of integers, you want to know whether it is possible to divide theintegers into two sets, so that the sum of one set is odd, and the sum of theother set is a multiple of 10.Every integer must be in one set or the other.You can write a recursive helper method that takes any number of argumentsand then call it inside the method, but you cannot use any loops.Test cases:oddAndTen ([5, 5, 3])oddAndTen ([5, 5, 4])oddAndTen ([5, 5, 4, 1])truefalsetrueFor example:TestResultList list = Arrays.aslist(5, 5, 3);trueSystem.out.println(oddAndTen(list));List listArrays.asList(5, 5, 4);falseSystem.out.println(oddAndTen(1list));List listArrays.asList(5, 5, 4, 1); true=System.out.println(oddAndTen(list));

Algorithm: Start Implement sum() method that takes a list as an argument and returns sum of all the…

Answered: Complete this code You can write a…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Complete this code
You can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops.

/**
* Decide if it is possible to divide the integers in a list into two sets,
* so that the sum of one set is odd, and the sum of the other set is a multiple of 10.
* Every integer must be in one set or the other.
* For example, oddAndTen([5, 5, 3]) → true,
* and oddAndTen([5, 5, 4]) → false.
* @param list is a list of integers.
* @return true iff there is one odd partition and the other multiple of 10.
*/
public static boolean oddAndTen(List<Integer> list) {
// call your recursive helper method
return ...
}

private static boolean oddAndTenHelper(...) { // add any parameters
// base case
// recursive step
}