The minimum no of edges needed to minimally connect any graph is n-1.Such a graph is called a tree.A tree is
i)Acyclic and connected → n-1 edges
ii)n-1 edges and connected → acyclic
iii)n-1 edges and acyclic → connected
Now addition of 1 more edge will render the graph cyclic
Correct answer is option B.