Question 2 2 pts Suppose that you are working with a CISC machine using a 1.5 GHz clock (i.e., the clock ticks 1.5 billion times per second). This particular computer uses MASM-like instructions with the following timings: add reg, mem 7 clock cycles (i.e., the ADD micro-program has 7 instr uctions) add reg, immed 2 clock cycles loop label 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 mov bx, 0 mov ecX, MAX SIZE mov esi, OFFSET list ;initialize array pointer ;initialize sum ;initialize loop counter more: add bx, esi add esi, 2 loop ; add current list element move array pointer to next element ; auto-decrement ecx, jump to more if ecx # 0 more After initialization, how many array elements can be processed in 3.9 ms? Round your answer to the nearest integer. Note that 1 ms. - 0.001 second