For all simple undirected graphs G(V, E) with even number of nodes such that the degree of each node in V is at least |V|/2 which of the following would be a correct statement about the graph. Assume denotation n=|V|.

i. G is a connected graph

ii. Total number |E| of edges in G is at least n^2/2

iii. There must be at least one node in V that has a degree n-1

iv. There is an edge e subset of E such that its removal disconnected G(i. e. the resulting graph (V, E-e) has at least 3 connected components)

v. G contains a complete subgraph Kn/2 (ie there are n/2 nodes in V such that these nodes and all edges between these nodes form a complete subgraph)