Half of the integers stored in the array data are positive, and half are negative. Determine the absolute speed of the following algorithm, assuming: the time to execute a memory access is 100 nanoseconds and that all other operations (arithmetic, register accesses, etc.) take 10 nanoseconds.

for(int i = 0; i<1000000; i++)

{ if(data[i] < 0 )

data[i] = data[i] * 2;

}