What is the worst-case complexity of the following code? void diag (double dll, int n) for (int i 0,i!-n, i++) d[i]- new double[n]; for (intj -0;n; j+) diJj]-]: for (int k 0; k!-i; k++) d[i][k]d[kj[j] d[ij[k]; O(log n) O(n) O(n log n) O(n ) O(n 5) none of the above 2 3