A graph is called $k$-connected if it remains connected after removing any $k-1$ vertices. What is the maximum $k$ such that $K_{n}$ is $k$-connected?