Prove that for every function $s(n)$ such that $n≤s(n)≤\frac{2^n}{100n}$ there exists a Boolean function $f:{0,1}^n→{0,1}$ such that $f$ doesn't have a Boolean circuit of size $s(n)$ that computes it but has a Boolean circuit of size $10s(n)$
Could anyone give me some help ?