Consider the following c-code fragment: for (i=0; i< 100; i++) z[i] = a[i] - b[i]; assume that - a, b, and z are arrays of 32-bit words. the machine code for this fragment is stored in memory starting from location 100 hex. a- convert this code to mips. you must provide the numeric offset for each branch or jump instruction that you use. (50 points) b- assume that the cpis for mips instructions on a multi-cycle system m1 are as listed below: lw : 5 cycles r-type, addi, sw, and other immediate arithmetic instruction : 4 cycles beq, bne, and j: 3 cycles other instructions: 4 cycles how many clock cycles does it take to execute the c-code fragment on system m1? justify your answer (20 points) c- assume that the clock rate for m1 is 2.5 ghz. what is the cpu execution time for the code on m1? (10 points) d- compute cpu execution time of the code for a single-cycle system with clock rate 1.6 ghz (20 points)