C Procedure from Question 1...

Question 2 1 pts Consider again the procedure from Question 1. Assume a machine for which the latency of integer addition is 1.0 cycle with issue time of 0.33 cycles, and the latency of integer multiplication is 3.0 cycles with issue time of 1.0 cycle. The lower bound on the CPE for the original procedure is 3.0. What is the lower bound on the CPE for the new procedure with a 2x2 version of the loop? Question 1 3/3 pts Consider the following procedure: int array_product(int all, int length) { int i, product; for(i = , product = 1; i