HMMT 2003 T4

(a) Suppose $A$ has $n$ elements, where $n \geq 2$, and $C$ is a 2-configuration of $A$ that is not $m$-separable for any $m<n$. What is (in terms of $n$ ) the smallest number of elements that $C$ can have?