Assume a processor that implements five stage pipelining where each stage takes $4ns.$ Consider the following program:

$)==(R_2$

In this program, $R_0{R}_2.$ However, the computer always predicts that $R_0=R_2.$

a$.$ Compute the total time needed for sequential execution $($no pipelining$).$

b$.$ Identify the hazards in the program.

c$.$ Complete the pipelining diagram where forwarding is not allowed. Justify your decisions briefly $(1$ line each$).$

d$.$ Find the total time of execution after pipelining.

e$.$ Find the saving percentage due to pipelining.

f$.$ Repeat $c,d,$ and e when forwarding is allowed.