Question $2(20$ points$).$ Assuming the following functional unit latencies:

$.$ What is the cycle time of a single$-$cycle implementation? What is the cycle time of a pipelined

implementation?

Given the program below:bne a$3,$t$1,$ Exit

add $t$0,$$$0,$$$0$

add $t4,$a$0,$$a$12).$ Plot the pipeline diagram to show the execution of these five instructions. $[$hint: The instruction

sequence is shown vertically, from top to bottom. Clock cycles are shown horizontally, from left to right.

Each instruction is divided into its component stages.$].$

$.$ If the given program is run on the single$-$cycle implementation, how many cycle does it take to

execute these five instructions? How long does it take to complete execution $($ns$)?$

$.$ If the given program is run on the pipelined implementation, how many cycles does it take to

execute these five instructions? How long does it take to complete execution $($ns$)?$