This is a Graph Theory question.

Prove using a mathematical proof that if G is k-edge-connected, then |E(G)| >= k |V(G)| /2.

|E(G)| is the number of edges in G

|V(G)| is the number of vertices in G