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< 1; i++) { if (datali] 0) data [i] = data[i] 2; *