solve

Question 9 3 pts Chapter 10 introduced graph theory, travels on a graph, and adjacency matrices. Choose all the statements about graphs or trees that are true. [At least one statement will be true.] (0 Every graph has at least one terminal vertex. Every non-trivial tree has at least two terminal vertices. () Every connected graph has at least two spanning trees. A trail can contain a repeated vertex, but a path cannot