A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$

We prove that the complexity of computation of the threshold symmetric function $T_n^{n-1}$ by monotone switching networks is $\Omega(n \log \log n)$.