The minimum number of edges required to create a cyclid graph of n vertices is

• A. n
• B. n+1
• C. n-1
• D. 2n