Proof approach for $n! \ge (n/2)^{n/2}$

Question

I am having trouble proving that $n! \ge \frac{n}{2}^{\frac{n}{2}}$ for all $n \ge 2$. Intuitively, I can see how this is true. However, I am struggling with a formal proof and dont know which way to go