A graph is $k$-connected if every pair of vertices remains connected after removing any $(k-1)$ vertices. What is the maximum $k$ for which $K_n$ is $k$-connected?