Consider a version of the pipeline from Section $4\mathrm{.}5$ in the book that does not handle data

hazards $($i$.$e$.$ the programmer is responsible for addressing data hazards by inserting NOPs where

necessary$).$ Supposed that after optimization a typical n$-$instruction program requires an

additional $0\mathrm{.}4*$n NOPs to correctly handle data hazards.