Suppose that you are working with a cisc machine using a 1.7 ghz clock (i. e., the clock ticks 1.7 billion times per second). this particular computer uses masm-like instructions with the following timings: add reg, mem 4 clock cycles (i. e., the add micro-program has 4 instructions)add reg, immed 3 clock cyclesloop label 5 clock cyclessuppose 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 pointermore: add bx, esi ; add current list element add \textrm{6}, 2 ; move array pointer to next element loop more ; auto-decrement ecx, jump to more if ecx ≠ 0after initialization, how many array elements can be processed in 2.1 ms? round your answer to the nearest integer.