Problem $3(12$ pts$)$

Consider the following assembly language code:

$10$: Iw $R$9,4,($$R$1)$

$//$ LDW R$9-$ MEM$[$R$1+4]$;

I$1$: add $R$3,$$R$4,$$R$9$

$//$ADD R$3=$ R$4+$ R$9$:

$12$: Iw $R$1,100($$R$3)$

$/$LDW R$1-$ MEM$[$R$3+100]$;

$13$: add $R$4,$$R$1,$$R$0$

$//$ADD R$4=$ R$1+$ R$0$;

$14$: Iw $R$1,$O$($$R$3)$

NLDW R$1=$ MEM R $3+0]$;

$15$: sub $R$3,$$R$1,$$R$4$

$//$SUB R$3=$ R$1-$ R$4$;

$16$: and $R$9,$$R$9,$$R$7$

$//$AND R$9-$ R$9$ & R$7$;

I$7$: Iw $R$2,100($$R$4)$

$//$LDW R$2=$ MEM$[$R$4+100]$:

I$8$: SW $R$4,100($$R$2)$

$//$STW MEM$[$R$2+100]-$ R$4$;

$19$: add $R$1,$$R$5,$$R$4$

$//$ADD R$1=$ R$5+$ R$4$: data$).$

a$)$ What is the final execution time of the code?

$\backslash$table$[[,$TO$,$T$1,T2,$T$3,$T$4,$TS$,$T$6,T7,$T$8,$T$9,$T$10,$T$11,T12,$T$13,$T$14,$T$15,$T$16,$T$17],[10,,,,,,,,,,,,,,,,,,],[11,,,,,,,,,,,,,,,,,,],[12,,,,,,,,,,,,,,,,,,],[13,,,,,,,,,,,,,,,,,,],[14,,,,,,,,,,,,,,,,,,],[15,,,,,,,,,,,,,,,,,,],[16,,,,,,,,,,,,,,,,,,],[17,,,,,,,,,,,,,,,,,,],[18,,,,,,,,,,,,,,,,,,],[19,,,,,,,,,,,,,,,,,,]]$

There is a total of cycles

b$)$ Verify that the program takes number of cycles found in the previous part speedups:

i$)$ Using a single$-$cycled processor.

ii$)$ Using a pipelined processor.

$\backslash$table$[[$IF$,$ID$,$EX$,$MEM,WB$,\backslash$table$[[$Pipeline$],[$Register$]]],[45$ ps$,50$ ps$,35$ ps$,65$ ps$,30p5,15p5$