Consider the following fragment of C code:

for (i = 0; i < 100; i++) { A[i] = B[i] + C; }

Assume that A and B are arrays of 64-bit integers, and C and i are 64-bit integers. Assume that all data values and their addresses are kept in memory (at addresses 1000, 3000, 5000, and 7000 for A, B, C, and i, respectively) except when they are operated on. Assume that values in registers are lost between iterations of the loop. Assume all addresses and words are 64 bits.

Write the assembly code for x86. How many instructions are required dynamically? How many memory-data references will be executed? What is the code size in bytes?