Answer Happy

void funco(int n) { for (int i = 0; i < n*n; i++) { for (int j = 0; j < log n; j++){ print i*j; } } The Big-O complexity of the above function is: O(n log n) O(n*n log n) 0(1) O(n + log n) }