algorithm (figure 8.2 in textbook \#2). Report the intermediate states of the array after each step. State the number of add operation performed. algorithm (figure 8.2 in textbook \#2). Report the intermediate states of the array after each step. State the number of add operation performed. _global_ void Kogge-Stone_scan_kernel(float * X, float *Y, int Inputsize) \& _ shared_ float XY[SECTION_SIZE]; int i= blockIdx. x blockDim. x + threadIdx. x; if (in stride) XY[threadIdx,x] + XY[threadIdx,x-stride ]; \} Y[1]=XY[ threadid,x]; y