A graph G has 42 vertices and has the property that there is one and only one path joining any two vertices of the graph. Which of the following statements [A), B), C), or D)] is not true?
◦ G must have 41 edges.
◦ G must be connected.
◦ Every edge of the graph must be a bridge.
◦ G cannot have any circuits.
◦ all of these statements are true.