I need you to generate both the unoptimized and optimized assembly code from the C source code, $$which I$$ve provided to you in both image form and text form just in case to avoid any indenting errors from the text version down below. I need the assembly code for both the unoptimized and optimized versions. I repeat I am asking for the ACTUAL CODE of both the unoptimized and optimized versions, not how to do it$.$ I have had this problem already where the person that tried to solve this didn't actually give me the code for both unoptimized and optimized. Please make sure to give me the actual code for both.

If you're somehow unsure how to generate these files, I believe you can use the following commands:

For unoptimized assembly:

gcc $-$Wa$,-$adhln $-$g $-$masm$=$intel $-$m$32"$Project $2.$c$">"$Project $2-$g$.$asm"

For optimized assembly:

gcc $-$Wa$,-$adhln $-$O $-$masm$=$intel $-$m$32"$Project $2.$c$">"$Project $2-$o$.$asm"

Once you generate these, please send both the codes of the unoptimized and optimized and let me know which one is which. Thank you!

$/*$GCC $*/$

$/*$gcc $-$Wa$,-$adhln $-$g $-$masm$=$intel $-$m$32"$Project $2.$c$">"$Project $2-$g$.$asm" $*/$

$/*$gcc $-$Wa$,-$adhln $-$O $-$masm$=$intel $-$m$32"$Project $2.$c$">"$Project $2-$o$.$asm" $*/$

#include

#define NOINLINE $\_\_$attribute$\_\_(($noinline$))$

static NOINLINE int function$1($int x$,$int y$)$

$\{$

int i;

int sum;

int values$[10]$;

sum $=0$;

for $($i $=0$; i $<mi></mi><mn>1</mn><mn>0</mn>$; i$++)\{$

values$[$i$]=10+$i $+2*$x $*$y;

sum $+=$values$[$i$]$;

$\}$

return $($sum$)$;

$\}$

static int NOINLINE function$2($int $*$values$,$int valuesLen$)$

$\{$

int i;

int sum$1$;

int sum$2$;

int v;

sum$1=0$;

sum$2=0$;

for $($i $=0$; i $<mtext></mtext><mi></mi>$valuesLen; i$++)\{$

v $=$values$[$i$]$;

if $($v $>0)$

sum$1+=$v;

else

sum$2+=$v;

$\}$

return $($sum$1+$sum$2)$;

$\}$

static NOINLINE int function$3($int x$)$

$\{$

int y;

y $=$x $/10$;

return $($y$)$;

$\}$

static NOINLINE int function$4($int a$,$int b$,$int c$,$int d$)$

$\{$

int r;

if $($a $>$b$)$

r $=$b;

else if $($a $>$c$)$

r $=4*$a;

else if $($a $>$d$)$

r $=8*$a;

else

r $=-1$;

return $($r$)$;

$\}$

static NOINLINE unsigned int function$5($unsigned int x$)$

$\{$

unsigned int x$1$;

unsigned int x$2$;

unsigned int x$3$;

x$1=$x $*32$;

x$2=$x $/16$;

x$3=$x $\%8$;

return $($x$1+$x$2+$x$3)$;

$\}$

int main$($int argc, char $**$argv$)$

$\{$

int i;

int j;

int k;

int values$[10]$;

i $=5$;

j $=8$;

k $=$function$1($i$,$j$)$;

printf$("$function$1$: i $=\%$d$,$j $=\%$d$,$k $=\%$d

$",$i$,$j$,$k$)$;

for $($i $=0$; i $<mi></mi><mn>1</mn><mn>0</mn>$; i$++)\{$

values$[$i$]=$i $+$j;

$\}$

k $=$function$2($values$,10)$;

printf$("$function$2$: k $=\%$d

$",$k$)$;

k $=$function$3(100)$;

printf$("$function$3$: k $=\%$d

$",$k$)$;

k $=$function$4(1,2,3,4)$;

printf$("$function$4$: k $=\%$d

$",$k$)$;

k $=$function$5(100)$;

printf$("$function$5$: k $=\%$d

$",$k$)$;

return $(0)$;

$\}$