Assume that an instruction can be executed in $4$ stages: S$1($stage $1)$ takes $200ns,S2$ takes $100ns,$ S$3$

takes $538\mathrm{.}9ns,$ and $S4$ takes $100ns.$

In a pipelined implementation with balanced stages, what is the execution time of $90$ instructions in ns$?$

$**$ Example $-$ If answer is $50\mathrm{.}235ns$ write $50\mathrm{.}24$

Answer:

The correct answer is: $50117\mathrm{.}70$