For this snippet in C$++$ you will implement factorial both iteratively and recursively.

For the iterative implementation simply take in the value to factorialize and call it x$.$ Create a for loop counting backwards from x to $0($meaning stop after the $1$ and before the $0).$ Create a variable fact $=1$ before the loop. Call the counting variable of the loop i$.$ for $($i$=$x$,$ i$>0,$ i$--)$; $//$the loop control. Inside the loop you execute fact $=$ fact $*$I; $//$this is the creation of the factorial. Print the result.

For the recursive version use:

long fact $($int x$1)\{$

long ans$=1$;

if $($x$1==1)$ return $(1)$; $//$ trivial case

else $\{$

ans $=$ x$1*$ fact$($x$11)$; $//$ the reducing step

return$($ans$)$;

$\}$

$\}$

$[$HINT: factorials get very big, very fast, be careful of overflow$]$