$($Q$4)[20$ points$]$

Assume No branching hazards and no pipelining in this question.

$($a$)$ Translate the following c code into MIPS Assembly?

Assume the following:

i$$$s$0,$ j$$ $s$1,$ outerLoopLimit $5,$ innerLoopLimit $10,$ sum $$ $s$3,$ prod $$$s$4$

$//$ c code Nested looping example

int i$=0$; int j$=0$;

while $($i $<mn>5</mn><mi>)</mi>$

$\{$ j$=0$;

while $($j $<mtext></mtext><mn>1</mn><mn>0</mn><mi>)</mi>$

$\{$

if $($i$==$j$)$

sum$=$ i$+$ j ;

else

prod $=$ i$*$ j ;

j$+=4$ ;

$\}//$ end inner loop

i$++$;

$\}//$ end outer loop

b$)$ The translation of the statement sum$=$ i $+$ j ; into MIPS instruction is: add $t$0,$$s$0,$$s$1,$ how many times this instruction gets executed in your MIPS code with branches get executed. Trace your MIPS code