Multiple Choice 1 point possible (graded) Suppose thatI have an undirected graph with 10 vertices. What is the largest number of unique edges that I can have in the graph. 10 45 100 You have used 0 of 1 attempt Multiple Choice point possible (graded) Suppose that I have an undirected graph with 10 vertices. What is the fewest number of edges that I can have, while still having a connected graph, that is, a graph with a path between any pair of vertices: 5 10