$($Sphere Packing Bound for asymmetric errors$)$ Show that any one asym$-$

metric error correcting code of length $n$ can have a maximum of

$\frac{n}{2}$ codewords.