Upgrade subject to access all content

Let $S(n,k)$ be the number of ways to partition an $n$ element set with $k$ nonempty subsets, also called "blocks."

Which of the following is equal to $S(n,n-1)$?

2

${n-1 \choose 2}$

${n \choose 2}$

$n-1$