$2.4\mathrm{.}22\backslash ([5]<mi>\backslash </mi>$S $4\mathrm{.}6>\backslash )$ Consider the fragment of MIPS assembly below:

sd $\backslash$$s$5,12(\backslash$$s$3)$

Id $\backslash$$s$5,8(\backslash$$s$3)$

sub $\backslash$$s$4,\backslash$$s$2,\backslash$$s$1$

beqz $\backslash$$s$4,$ label

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

sub $\backslash$$s$2,\backslash$$s$6,\backslash$$s$1$

Suppose we modify the pipeline so that it has only one memory $($that handles both instructions and data$).$ In this case, there will be a structural hazard every time a program needs to fetch an instruction during the same cycle in which another instruction accesses data.

Draw a pipeline diagram to show were the code above will stall.

$[$ANS$]$

In general, is it possible to reduce the number of stalls$/$NOPs resulting from this structural hazard by reordering code?

$[$ANS$]$

Must this structural hazard be handled in hardware? We have seen that data hazards can be eliminated by adding NOPs to the code. Can you do the same with this structural hazard? If so$,$ explain how. If not, explain why not.

$[$ANS$]$

Approximately how many stalls would you expect this structural hazard to generate in a typical program? $($Use the instruction mix from Exercise $4\mathrm{.}8.)$

$[$ANS$]$