The following recursive method get Number Equal searches the array x of n integers for occurrences of the integer val. It returns the number of integers in x that are equal to val. For example, if x contains the 9 integers 1, 2, 4, 4, 5, 6, 7, 8, and 9, then getNumberEqual(x, 9, 4) returns the value 2 because 4 occurs twice in x. public static int getNumberEqual(int x[ ], int n, int val) { if (n < 0) { return 0; } else { if (x{n-1] == val) { return getNumber Equal(x, n-1, val) + 1; else { return getNumber Equal(x, n-l, val); } // end if } // end if > // end getNumber Equal Demonstrate that this method is recursive by listing the criteria of a recursive

in java  Revers an Array of n integers Reversing an Array1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code.

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}

A basic iterator offers all the following operations except Group of answer choices 1. Except nothing, it can do all of the listed operations. 2. Get the item at the current iteration 3. Return an array of all items 4. Determine if there are more items 5. Go to the next item