1.12 section 1.10 cites as a pitfall the utilization of a subset of the performance equation as a performance metric. to illustrate this, consider the following two processors. p1 has a clock rate of 4 ghz, average cpi of 0.9, and requires the execution of 5.0e9 instructions. p2 has a clock rate of 3 ghz, an average cpi of 0.75, and requires the execution of 1.0e9 instructions. [5] < §§1.6, 1.10> one usual fallacy is to consider the computer with the largest clock rate as having the largest performance. check if this is true for p1 and p2. [10] < §§1.6, 1.10> another fallacy is to consider that the processor executing the largest number of instructions will need a larger cpu time. considering that processor p1 is executing a sequence of 1.0e9 instructions and that the cpi of processors p1 and p2 do not change, determine the number of instructions that p2 can execute in the same time that p1 needs to execute 1.0e9 instructions.