Problem $2$: Again, do only part $($a$.)$ in the table.

Consider two different implementations, P$1$ and P$2,$ of the same instruction set. There are five classes of instructions $(A,B,C,D,$ and $E)$ in the instruction set. P$1$ has a clock rate of $4GHz,$ and P$2$ has a clock rate of $6GHz.$ The average number of cycles for each instruction class for $P1$ and $P2$ are listed in the following table.

$\backslash$table$[[,,$cPI class A$,$col chass $s,$cPI class c$,$cPI clasa D$,$cPI Class E$],[$a$.,$P$1,1,2,3,4,5],[$P$2,3,3,3,5,5],[$b$.,$P$1,1,2,3,4,5],[$P$2,2,2,2,2,6]]$

If the number of instructions executed in a certain program is divided equally among the five classes of instructions except for class $A,$ which occurs twice as often as each of the others, how much faster is P$2$ than P$1?$