Using the same ISA and CPI as above, suppose that a different compiler produced a program with $90,000,000$ instructions where $20\%$ were ld$,10\%$ were sd$,40\%$ were add, $10\%$ were sub, $10\%$ were mul, and $10\%$ were div. Assuming this program is functionally equivalent to the forogram in the previous problem and that it were run on Processor A with the same $4\mathrm{.}0GHz$ clowk rate, how much faster or slower would it be when stated in CPU time?