Consider the following code for the following problems loop: bl: b2: LW R4, 0 (R3) ADDI R3, R3, 4 SUBI R1, R1, 1 BEQ RO, R4, b2 ADDI R2, R2, 1 BNE RO, R1, loop ADDI R3, R3, 4 #RO is zero Assume R3 points to the array with all 0 entries. R1 = R2 = 5. 7) Consider the following ROB and how the above code will be executed with branch prediction assuming it is predicted as in (6). Fill the table and trace through how it might work with n = 4. next to commit use ex Reorder Buffer (ROB) Assume R1->P0, R2->P1, R3->P2, R4->P3 Free physical registers: P4 - P12 p1 PR1 p2 PR2 Rd LPRd PRd 8) How bits are each column in the ROB table to support standard 32-bit MIPS architecture? 9) What type of hazards are detected by ROB and avoided?