Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 billion times per second). This particular computer uses an instruction cache, a data cache, an operand fetch unit, and...

dont copy from any existing answer

diretly for sure i will downvote

dont post without knowledge

Extracted text: Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 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 cycles LOAD reg, mem ; 4 clock cycles ADD reg, reg ; 3 clock cycles ADD reg, immed ; 2 clock cycles LOOP _LabelName ; 8 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. SET reg1, 0 SET reg2, MAX_SIZE ;initialize loop counter SET reg3, @list ;initialize array pointer ProcessArray: LOAD reg4, [reg3] ;fetch current list element ADD reg1, reg4 ADD reg3, 4 LOOP _ProcessArray ;auto-decrement reg2, jump to more if reg2 # 0 If the initialization code has already executed (i.e. the SET instructions have already finished execution) how many array elements can be processed in 4.4 milliseconds (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. ;initialize sum ;add current list element ;move array pointer to next element