dependencies between all instructions s ID Instruction 11 Load x1, 0(X31) 12 Load x2, 8(x31) 13 Add x4, x1, x2 14 Mul x11, x2, x4 15 Sub x5, x1, x4 16 Load x6, 16(x11) 17 Add x6, X5, X6 18 Sub x7, x8, x9 19 Div x7, X7, x8 FO DEX EXEM MEWE Lood. A How Instruction ALU ALU Figure 1: 5-stage Pipeline without forwarding 445 T410 50 2150 - 89 a IR PDF 51028 Qm AA se 50 textbook Homework Assignment_da 4) Consider the 5-stage pipeline design we discussed in the lecture, shown in Figure 1, without forwarding paths. Optimize execution time by re-ordering instructions and then insert the minimum number of required NOPs into the instruction stream. The re-ordering must be correct, i.e. not change the output result of the code when applying transformations. Calculate the average CPI of this code, assuming a CPI of one for all instructions. Assume that registers from the register file can be written and read in the same cycle. (4 Points) A T