Maximum number of edges in a n-node undirected graph without self-loops is

• A. n2
• B. \(\frac{n(n – 1)}{2}\)
• C. n – 1
• D. \(\frac{n(n + 1)}{2}\)