Problem $2(20$ points$).$ For each sequence of instructions given in Problem $1,$ state the number of total stalls required if forwarding is not enabled in the datapath $($show your work$).$ Compare this number of stalls without forwarding to the stalls needed in Problem $1$ and determine how many total clock cycles forwarding saves for each sequence of instructions

Figure $2$: Sample pipeline execution diagram.

Draw the pipeline execution diagram for the two sequences of instructions given below when executed in the pipelined datapath described above. For sequence A assume the branch instruction is not taken, and for sequence B assume the branch instruction is taken. Your pipeline execution diagram should clearly indicate the forwarding paths that may be used and clearly mark a bubble $($i$.$e$.,$ stalled instruction$).$ An example of a pipeline execution diagram is given in Figure $2.$ You must draw a similar diagram but for the following sequences of instructions:

Sequence $($A$)$

$```$

add $t$0,$ $t$1,$ $t$2$

ori $t$1,$ $t$0,0$xF

lw $t$1,0($$t$1)$

beq $t$0,$ $t$1,$ LABEL

sw $t$1,0($$t$0)$

$```$

Sequence $($B$)$

sub $\backslash$$t$0,\backslash$$t$1,\backslash$$t$2$

and $\backslash$$t$0,\backslash$$t$0,\backslash$$t$2$

add $\backslash$$t$1,\backslash$$t$0,\backslash$$t$2$

beq $\backslash$$t$0,\backslash$$t$1,$ LABEL

$1$w $\backslash$$t$2,0(\backslash$$t$3)$

LABEL: $1$w $\backslash$$t$3,0(\backslash$$t$4)$