Consider a version of the pipeline from Section $4\mathrm{.}6$ that does not handle data hazards $($i$.$e$.,$ the programmer is responsible for addressing data hazards by inserting NOP instructions where necessary$).$ Suppose that $($after optimization$)$ a typical n$-$instruction requires an additional $4*$n NOP instructions to correctly handle data hazards.

$[10]<4\mathrm{.}6>$ Can a program with only $\mathrm{.}075*$n NOPs possibly run faster on the pipeline with forwarding? Explain why or why not.