A complete undirected simple graph is defined as a graph G=(V,E) where there is exactly one edge between every pair of vertices in V. Notice that the edges in an undirected graph have no direction (no "arrow") and that a simple graph must have at least 1 vertex and cannot have loops (edges that start and end at the same vertex). Which functions capture the number of edges E in a complete graph with n vertices? F(n) = {fon1 if n = 0 Fin - 1) +n if n>0 o feno= { {ren- F() if n=1 Fin - 1) +n if n> 1 Fusio F(n)= = { pun - 1) if n=1 Fin - 1) + (n − 1) if n > 1 Ormarus +10 19 F(n) = { if n = 1 Fin) + (n - 1) if n> 1 F(n)= 0 if n=1 Fin - 1) + 2(n-1) if n> 1 F(n) = = = { pm - 1 if n = 1 Fin - 1) + 2n if n>1