LDUR X$13,[$X$16,$ #$4]$

LDUR X$10,[$X$15,$ #$12]$

ADD X$11,$ X$15,$ X$14$

ADD X$12,$ X$10,$ X$14$

SUB X$15,$ X$13,$ X$14$

Suppose we modify the pipeline so that it has only one memory $($that handles both instructions and data$)$ and no forwarding or hazard detection units. In this case, there will be a structural hazard. To guarantee

forward progress, this hazard must always be resolved in favor of the instruction that accesses data.

a$)$ Draw a pipeline diagram to show where the above code will stall.

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

c$)$ 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.