Suppose that you are working with a CISC machine using a 2.5 GHz clock (i.e., the clock ticks 2.5 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ADD reg, immed LOOP _Label Name ; 7 clock cycles (i.e., the ADD micro-program has 7 instructions) ; 4 clock cycles ; 6 clock cycles Suppose that the following code fragment is used to sum elements of a numeric array. For this problem, assume that memory limitations are non-existent and that there is no limit to the size of the array. BX, ;initialize sum ;initialize LOOP counter ;initialize array pointer MOV 0 MOV ECX, MAX_SIZE MOV ESI, OFFSET list _ProcessArray: ADD BX, [ESI] 2 LOOP _ProcessArray ;Add current list element ; Move array pointe to next element ; auto-decrement ECX, jump to more if ECX = 0 After initialization, how many array elements can be processed in 3.1 millisecond (ms)? Round your answer to the nearest integer. Note that 1 ms = 0.001 second