show all steps clearly $3.(2$ points$)$ Assume a non$-$pipelined processor takes $100$ns to process an instruction. The same instruction can be executed in a $5-$stage pipelined processor, where each stage takes $20$ns$.($i$)$ What is the minimum number of instructions for which the speedup achieved by the pipelined processor $($compared to the non$-$pipelined processor$)$ is at least $3?($ii$)$ The instruction takes the same time $(100$ns$)$ to execute whether on the pipelined processor or on the non$-$pipelined processor. So why do we say pipelining speeds up execution$4$