For a graph $G$, the toughness $t(G)$ is defined as $\min \frac{|S|}{c(G-S)}$, where $c(G-S)$ is the number of components. What is the toughness of a complete graph $K_n$?