Consider the following MIPS code. Note that R$0($register $0)$ in the MIPS ISA always has a value of

zero. Assume that the branch is the first instruction executing after a jump.

a$)$ Convert the MIPS code into C:

b$)$ How many branch miss$-$predictions occur during this code's execution, if we use an

always$-$taken predictor?

Explain you answer:Consider the following MIPS code. Note that R$0($register $0)$ in the MIPS ISA always has a value of

zero. Assume that the branch is the first instruction executing after a jump.

$0$x$110$ li R$2,0$ # v$=0$

$0$x$114$ li R$3,16$ # Loop bound for LoopJ

$0$x$118$ li R$4,0$ # j$=0$

LoopJ:

$0$x$11$C beq R$4,$R$3,$EndLoopJ # Exit LoopJ if j$==16$

$0$x$120$ li R$5,0$ # k$=0$

LoopK:

$0$x$124$ beq R$5,$R$3,$EndLoopK # Exit LoopK if k$==16$

$0$x$128$ add R$6,$R$5,$R$4$ # k$+$i

$0$x$12$C andi R$6,$R$6,3$ # $($k$+$j$)\%4$

$0$x$130$ bne R$6,$R$0,$EndIf # Skip if $($k$+$j$)\%4!=0$

$0$x$134$ add R$2,$R$2,$R$5$ # v$+=$k

EndIf:

$0$x$138$ addi R$5,$R$5,1$ # k$++$

$0$x$13$C beq R$0,$R$0,$LoopK # Go back to LoopK

EndLoopK:

$0$x$140$ addi R$4,$R$4,1$ # j$++$

$0$x$144$ beq R$0,$R$0,$LoopJ # Go back to LoopJ

EndLoopJ:

a$)$ Convert the MIPS code into C:

b$)$ How many branch miss$-$predictions occur during this code's execution, if we use an

always$-$taken predictor? $\_\_\_\_\_\_\_\_\_\_$

Explain you answer