we saw a graph on n vertices with only 11 1 edges with diameter 2. The (Iowa-side of that graph {as a network) was that taking out the center vertex left us without any connections at all. Describe a graph with the feWest number of edges so that even if a vertex is taken out, everybody is still connected to everybodv elm fevpmf For the vertex that was removed). , .. _ Your solution needs to work for all n. for run credit your graphs must have the smallest possible number of edges