What is the result of following code after optimization?

for(i = 0; i< n ; i++)

for (j = 0 ; j < n ; j++)

 a[n*i + j] = b[j];

int ni = 0 ;

for (i =0 ; i

for(j =0 ; j < n ; j++)

a[ni + j ] = b [j];

ni = ni +n;

int ni = 0 ;

for (i =0 ; i

for(j =0 ; j < n ; j++)

a[ni] = b [j];

ni = ni +n;

int ni = 0 ;

for (i =0 ; i

for(j =0 ; j < n ; j++)

a[ni + j ] = b [j];

ni = ni *n;

int ni = 0 ;

for (i =0 ; i

for(j =0 ; j < n ; j++)

a[ni + j ] = b [ni + i];

ni = ni +n;