Consider the following iterative function:

int square $($int $n)\{$

int result $=0$;

for $($int $i=1$;$in$; $i++)$

result $+=2*i-1$;

return result;

$\}$

Rewrite the function square using recursion and add preconditions and postconditions as

comments. Then prove by induction that the recursive function you wrote is correct.