1. For this problem, assume that each instruction takes the same number of cycles, and use the code listed below. mov Sr2, #4 jmp L1 Loop: mul Sr3, Sr3, $rl add $r4, $r4, $rl ld $r5, [Sr3] sub $r5, $r5, #5 add $r0, $r0, #1 bne SrO, Sr2, Loop mov Sr1, $r2 L1 : (a) [3 points] How many instructions does this program execute (there might be several iterations)? What is the total number of memory type instructions (load and store instructions)? What is the proportion of memory instructions? technology. What is the overall speedup for the entire program? same program with the new memory, what is the maximum possible theoretical overall speediup for this (b) [2 points] Assume we can get a 10x speedup for memory instructions by employing a new memory (c) [2 points] In the future, we can make the memory instructions as fast as we want. When we run the program