Question $3$:

Consider the following assembly language program that evaluates the difference of two arrays and

stores the result to the first array. The program is executed on a pipelined processor with $5$ stages,

namely: F$,$ D$,$ E$,$ M and W$,$ while all pipeline stages require one clock cycle.

$($a$)$ Evaluate the number of clock cycles required to execute one loop iteration showing all the

necessary timing steps. Assume that there is no forwarding$/$bypassing implemented. Further, the

result of branch instruction is available after $E($execute$)$ stage.

$($b$)$ Now the pipeline is modified by implementing forwarding$/$bypassing and the result of branch

instruction is available after D $($decode$)$ stage. Find the number of clock cycles required for one

loop iteration and show the timing steps.