From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

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