a problem involving binary entropy function

Question

let $\alpha<1/2$ such that $2^{H(\alpha)}\le 2^{1-\epsilon}$,when $H$ is binary entropy function.

how can i prove that then we have:

$2^{n(1-\epsilon)}\ge \sum\limits_{i\le \alpha n } {n \choose i}$?

thank u