Function f has input size of n bits. In classical computation, how many evaluations are needed to capture the constant vs$.$ balanced property of f$?$

$2^\{$n$-1\}$

$2^\{$n$-1\}+1$

$1$

$2$ power n