3. Assume we execute the same call to sum on a processor that implements pipelining and has the pipeline stages and 200 picosecond clock period as shown below.

Assume we execute the same call to sum on a processor that implements pipelining and has the pipeline stages and 200 picosecond clock period as shown below. How long would it take to sum the array if no stalls (nop instructions) needed to be inserted (-- this isn't possible but you should assume it is)?