Graphs (Data Structures), ASAP please.

An undirected complete graph with 10 vertices will have 45 edges. True False Consider an undirected weighted graph defined as follows: Set of vertices = {0, 1, 2, 3, 4}. An edge are described by three numbers (vertexl, vertex2, weight), Set of edges = {(0, 1, 20), (0, 2, 15), (0, 3, 25), (0, 4, 50), (1, 3, 30), (3, 4, 10)} Which of the following is a description of the minimum cost spanning tree of the graph described above? a. Set of vertices = {0,1,2,3,4} and Set of edges = {(0,1), (0,2), (0,3), (3,4)}. b. Set of vertices = {0, 1, 2, 3, 4} and Set of edges = {(0,1), (0,2), (0,3), (0,4)}. c. Set of vertices = {0, 1, 2, 3, 4} and Set of edges = {(1,3), (0,2), (0,3), (3,4)}. d. Set of vertices = {0, 1, 2, 3, 4} and Set of edges = {(0,1), (0,4), (0,3), (3,4)}. A spanning tree is also a spanning graph. True False The depth first search will visit every node in an undirected graph only if the graph is connected. True False The breadth first search can be used on a tree. True False