$6$ pts$)$ In this exercise, we examine how data dependences affect execution in the basic $5-$

stage pipeline described in Section $4\mathrm{.}6.$ Problems in this exercise refer to the following

sequence of instructions:

add x$10,$ x$11,$ x$12$

add x$11,$ x$10,$ x$13$

add x$10,$ x$10,$ x$11$

Also, assume the following clock cycle times for each of the options related to forwarding:

Without Forwarding With Full Forwarding

$200$ps $250$ps

ng With Full Forwarding With ALU$-$ALU Forwarding Only

a$.(2$ pts$)$ Assume there is no forwarding in this pipelined processor. Indicate hazards and

add nop $($no operation$)$ instructions to eliminate them $($list instruction sequences with

nop$).$

b$.(2$ pts$)$ Assume there is full forwarding. Indicate hazards and add nop instructions $($if

necessary$)$ to eliminate them.

c$.(2$ pts$)$ What is the total execution time of this instruction sequence without forwarding

and with full forwarding, respectively?