Graphs (Data Structures), ASAP please.

A directed complete graph with 10 vertices will have 45 edges. True False A spanning tree with 10 vertices will have exactly 7 edges. True False If a spanning tree of a graph has n vertices, the graph must have n+1 edges. True False A spanning graph need not have all the vertices of the original graph. True False Prim's algorithm is an algorithm for building a minimum spanning tree. True False In a directed graph, edge (v,w) = edge (w,v). True False An edge in a directed graph is represented by an ordered pair. True False Consider an undirected graph defined as follows: Set of vertices = {0, 1, 2, 3, 4} and Set of edges = {(0, 1), (0, 2), (0,3), (0, 4), (1,3), (3, 4)} The graph is biconnected. True False Consider the following weighted directed graph description: Set of vertices = {0,1, 2, 3,4}. An edge is described by three numbers (vertexl, vertex2, weight), Set of edges = {(0, 2, 8), (0, 3, 2), (1, 0, 5), (2, 4, 6), (3,1, 7), (3, 4, 3)}. The shortest path (that is, the path with the least cost) from vertex 1 to vertex 4 is: a. (1, 3, 4) b. (1, 0, 2, 4) c. (1, 0, 3, 4) d. (1, 2, 3, 4) An adjacency matrix is a two-dimensional array implementation for a graph. True False