Exercise 4.13 In this exercise, we examine how data dependences affect execution in the basic 5-stage pipeline described in Section 4.5. Problems in this exercise refer to the fol- lowing sequence of instructions: Instruction Sequence SW R16.-100(R6) ADD R5 R4 R4 b. OR R1,R2.R3 OR R2.R1.4 LW R4,8(R16) OR RI.R1,R2 4.16 Exercises 421 4.13.1 [10] Indicate dependences and their type. 4.13.2 [10] Assume there is no forwarding in this pipelined processor. Indicate hazards and add NOP instructions to eliminate them. 4.13.3 [10] Assume there is full forwarding. Indicate hazards and add NOP instructions to eliminate them. Without Forwarding 250ps 180ps With Full Forwarding With ALU-ALU Forwarding Only 300ps 290ps 240p 210ps 4.13.4 [10] What is the total execution time of this instruction sequence without forwarding and with full forwardingWhat is the speedup achieved by adding full forwarding to a pipeline that had no forwarding? 4.13.5 [10] Add NOP instructions to this code to eliminate hazards if there is ALU-ALU forwarding only (no forwarding from the MEM to the EX stage). 4.13.6 (10) What is the total execution time of this instruction sequence with only ALU-ALU forwarding? What is the speedup over a no-forwarding pipe- line