lw x2, 0(x0) lw x1, 4(x0) add x4,x1,x2 sw x4,12(x0) lw x3, 8(x0) add x5,x1,x3 sw x5,16(x0) Now, assume the forwarding is enabled to eliminate stalls due to data hazards (except load-use case), and show the forwarding paths. How many cycles does it take to execute the given instructions when forwarding is enabled? You can use the following representation for the pipeline to simplify the depiction (this is for just illustration purpose)