A complete undirected graph of n nodes can have maximum ______ spanning trees.

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