In a certain program, the N elements of the A array are computed in parallel using the same program by the code fragment

for(i=1; i<=N; i++) {

A[i] = A[i21] * B[i];

;

}

Either recommend a data partitioning scheme to achieve good speedup for the computation or argue why it cannot be done.