Bad Qubits — Learn Quantum by Doing

Multiple choice

For deciding whether an n-bit function is constant or balanced (with certainty), what is the worst-case classical query complexity, while Deutsch-Jozsa uses exactly one query?

log2(n)
n + 1
2
2^(n-1) + 1