$(10$pt$)$ For the following codes, compute the

required cycle. Note that it has a five$-$stage

pipelining and forwarding logic. Reschedule the

code to minimize the required cycles.

$(a)lw$ $$1,0($$$2)$

addi $$3,$$$1,3$

$lw$ $$5,4($$$2)$

add $$4,$$$5,$$$6$

and $$7,$$$3,$$$1$

$lw$ $$8,0($$$3)$

$sw$ $$7,0($$$8)$

$(b)1w$$$1,0($$$2)$

$lw$ $$3,0($$$2)$

beq $$1,$$$3,x$

nop

add $$4,$$$5,$$$6$

and $$7,$$$3,$$$1$

$X$: $sw$ $$7,0($$$8)$

please solve a and b