Suppose that you are working with a cisc machine using a 2.4 ghz clock (i. e., the clock ticks 2.4 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 instructions) add reg, immed 4 clock cycles loop label 7 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 ; initialize sum mov ecx, max_size ; initialize loop counter mov esi, offset list ; initialize array pointer more:

add bx, [ esi ] ;

add current list element add esi, 2 ;

move array pointer to next element loop more ;

auto-decrement ecx, jump to more if ecx ≠ 0 after initialization, how many array elements can be processed in 2 ms?

round your answer to the nearest integer.

note that 1 ms. = 0.001 second.