Question 3 (10 points) The following code was run on a system that has a two-way set associative cache (N=2) and a block size = 1 word addi $t0, S0, 10 loop: beq St0, S0, done Iw St1,0x4(S0) Iw St2, 0x24(S0) addi St0, St0, -1 Assuming that the cache memory was initially empty: a) What is the miss rate after running this code? b) What is the hit rate after running this code? If the code was changed (by adding two extra load instructions) to addi St0, S0, 10 loop:beq St0, S0, done lw Stl, 0x4(S0) lw St2, 0x24(S0) lw St3, 0x34(S0) lw St4, 0x44($0) addi St0. St0, -1 Again, assume that the cache memory was initially empty: a) What is the miss rate after running this updated code? b) What is the hit rate after running this updated code? c) How do you think the hit rate can be increased