Consider a processor with a 4-stage pipeline (Fetch, Decode, Execute, Write-back). Each stage takes 10 nanoseconds
to complete. Assume the following without pipelining, a single instruction takes 40 nanoseconds to complete
(10 nanoseconds for each stage)
• Calculate the total time to execute 100 instructions with and without pipelining.
• Determine the speedup achieved using pipelining.