Question $7$

Suppose that you are working with a CISC machine using a $2\mathrm{.}2$ GHz clock $($i$.$e$.,$ the clock ticks $2\mathrm{.}2$ billion times per second$).$ This particular computer uses MASM$-$like instructions with the following timings:

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 ECX, MAX$\_$SIZE ; initialize LOOP counter

MOV ESI, OFFSET list ; initialize array pointer

$\_$ProcessArray:

ADD BX$,[$ESI$]$ ;Add current list element

ADD ESI, $2$ ;Move array pointer to next element

LOOP $\_$ProcessArray ;auto$-$decrement ECX, jump to more if ECX

eq$\}$After initialization, how many array elements can be processed in $2\mathrm{.}6$ millisecond $($ms$)?$ Round your answer to the nearest integer. Note that $1$ms$=0\mathrm{.}001$ second.