The number of ways of choosing $N_1$ items from a collection of $N>N_1$ items without respect to ordering is
$$
W=\frac{N !}{N_{1} ! N_{2} !}
$$
where $N_2=N-N_1$. Calculate $\ln W$, making use of Stirling's approximation $\ln n ! \simeq n \ln n-n$, which is very accurate for large $n$. Express your result in terms of $N$ and $x \equiv N_1 / N$, and compare with equation (9.14).