please show how we got this answer

Question 3 0/2 pts Suppose you have a RISC machine with a 2.3 GHz clock (i.e., the clock ticks 2.3 billion times per second). This particular computer uses an instruction cache, a data cache, an operand fetch unit, and an operand store unit. The instruction set includes simple instructions with the following timings: set reg, immed 3 clock cycle Loop label 1 clock cycles add reg, immed 2 clock cycle add reg, reg 3 clock cycles load res, mem 3 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. If the initialization code has already executed (i.e. the SET instructions have already finished execution) how many array elements can be processed in 2 ms? Round your answer to the nearest integer. Recall that 1 ms = 0.001 seconds. Also assume that there are no physical memory limitations, implying that the array can be as large as desired. set 1, 0 ;initialize sum set r2, MAX_SIZE ; initialize loop counter set r3, @list ;initialize array pointer more: load r4, r3 ; fetch current list element add r1, r4 ; add current list element add r3, 4 move array pointer to next element loop more jauto-decrement r2, jump to more if r2 - 0 swered 328571.0000 Answer 511111.0 margin of error +/- 1.0