(a) Identify the data dependencies in the following code (RAW, WAW, WAR). Show how register renaming can be used to remove some of the dependencies (Assume registers r8 and r9 are available). [6 pts] r4 r2 + r3 r2 r1 r3 r5 r3 / r4 r4 r1 r3 beq r5, r2, exit (b) Consider the loop below. How does a 1-bit predictor compare with a 2-bit predictor? Illustrate by assuming the code below is executed two consecutive times and the predictor is initially set to NT (not taken). Then compare the number of times the branch instruction bne is incorrectly predicted by the two methods. [5 pts] Label: add $t0, $zero, $zero addi $t1, $zero, 5 addi sub bne $t0, $t0, 1 $t2, $t1, $te $t2, $0, Label