Another fallacy is to consider that the processor

executing the largest number of instructions will need a larger CPU time.

Considering that processor P$1$ is executing a sequence of $1\mathrm{.}0$E$9$ instructions and

that the CPI of processors P$1$ and P$2$ do not change, determine the number of

instructions that P$2$ can execute in the same time that P$1$ needs to execute $1\mathrm{.}0$E$9$

instructions.