We get maximum edges in a disconnected graph of $n$ vertices when one vertex is isolated and remaining $n-1$ vertices are completely connected giving $\dfrac{(n-1)(n-2)}{2}$ edges. For $n=12,$ we get maximum $\dfrac{11\cdot 10}{2} = 55$ possible edges.
So, the correct answer is $55.$