Please explain solution in full detail so I can learn.

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 res, mem 6 clock cycles (d.e. the ADO micro-program has 6 instructions) add reg, immed 3 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. jinitialize sum mov bx, 0 mov ecx, MAX SIZE ;initialize loop counter mov esi, oFFSET list ;initialize array pointer add bx, esi add current list element add [esi], 2 move array pointer to next element ;auto-decrement ecx, jump to more if ecx # 0 loop more After initialization, how many array elements can be processed in 2.8 ms? Round your answer to the nearest integer. Note that 1 ms. = 0.001 second