(10 points total) Assume our processor has a very simple pipelined instruction execution. Only one instruction can be in each pipeline stage at a time. Each instruction must go through each pipeline stage. There are three stages, Fetch, Decode, and Execute, which take 2ns,2ns, and 4ns, respectively. We have a sequence of ten instructions to execute and which will not cause any pipeline stalls. Time a. (8 points) How long does it take to fully execute the ten instructions? b. (2 points) How long would the same instructions take in a non-pipelined execution where each instruction takes 8 ns