int j = 2 while (j < n) { int k = j while (k < n) { Sum += a[j]*b[k] k = k * k } j = sqrt(2) * j } Time complexity of this code