The minimum number of edges in a connected cyclic graph on n vertices is

• A. n
• B. n+1
• C. n-1
• D. none of the above