Problem $2$: Consider the following C function.

$(1)$ Convert it into IR in a three$-$address code format $($using operations similar to those mentioned in the slides; no need to cover parameter passing or variable declaration$/$allocation$)$

$(2)$ Draw the control$-$flow graph $($CFG$)$ for your three$-$address code

int factorial$($int n$)\{$

if $($n $==0||$ n $==1)\{$

return $1$;

$\}$ else $\{$

int result $=1$;

for $($int i $=2$; i $<=$ n; $++$i$)\{$

result $*=$ i;

$\}$

return result;

$\}$

$\}$