12. Suppose a pipeline processor has three stages, as shown in Figure 1-14. Assume in a perfect scenario (such as no branch instructions, no data dependence between a) How many clock cycles does it take to execute 10 instructions? What is the ) How many clock cycles does it take to execute n instructions? If n is instructions, and no memory 1/O waiting) throughput (measured in instructions per cycle)? sufficiently large, what is the throughput in terms of instructions per cycle