memory operations, and branches. The following table gives the number of instructions that belong to each type in a program, the number of cycles speedup in execution of that instruction type from a proposed improvement. 2) (30 points) Consider an architecture that has four types of instructions; additions, multiplications it takes to execute each instruction of that type, and the Execution Time TimeSpeedup of Instruction Type Number (in million) (cycles/instruction) Instruction Type Addition Multiplication Memory Branch 10 30 35 15 2 cycles 20 cycles 10 2.0 1.3 3.0 4.0 a. What is the fraction of execution time (in cycles) for each type of instruction with respect b. What is the value of CPI for the entire program? c. Determine and rank the overall speedups for each proposed improvement (from high to low). to the total execution time