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.