After graduating, you are asked to become the lead computer designer at Speedo Computers,

Inc. Your study of usage of high$-$level language constructs suggests that procedure calls are

one of the most expensive operations. You have invented a scheme that reduces the loads and

stores normally associated with procedure calls and returns. The first thing you do is run some

experiments with and without this optimization. Your experiments use the same state$-$of$-$the$-$

art optimizing compiler that will be used with either version of the computer. These

experiments reveal the following information:

The clock rate of the unoptimized version is $5\%$ higher.

$30\%$ of the instructions in the unoptimized version are loads or stores.

The optimized version executes $\frac{2}{3}$ as many loads and stores as the unoptimized

version. For all other instructions the dynamic counts are unchanged.

All instructions $($including load and store$)$ take one clock cycle.

Which is faster? Justify your decision quantitatively.