13.5.3: Produce a non-recursive method for counting zeroes in an array. Here is a recursive method for counting all zeroes in an array starting with a given position: public static int zeroes(int[] a, int pos) { if (pos == a.length) { return 0; } int result = zeroes(a, pos + 1); if (a[pos] == 0) { return result + 1; } else { return result; } } Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter). Move . Cancel Esc

Keyboard: Grab/release Spacebar (or Enter ). Move . Cancel Esc Unused Arrays.java Load default template... int result =zeroes(a, pos +1); if (a[pos]==0) public static void main (String [] args) \{ \{ result++; Scanner in = new Scanner(System.in); \} int arraysize = in.nextInt (); int [ ] intarray = new int [arraysize]; if (a[ pos ]==0) System.out.print( Array contents: "); \{ for (int i=0;i