Convert the following recursive program scheme into an iterative version that does not use a stack. f(n) is a method that returns TRUE or FALSE based on the value of n, and g(n) is a method that returns a value of the same type as n (without modifying n itself). int rec(int n) if(f(n) == FALSE) { /* any group of statements that do not change the value of n */ return (rec(g(n))): }//end if return (O): }l/end rec