Graphs (Data Structures), ASAP please.

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)} Which of the following CANNOT be an order that the vertices are visited using the breadth-first search starting a vertex 1? a-1,0, 3, 2, 4 b. 1,0, 2, 3,4 c. 1,3, 0,4, 2 d. 1, 0, 3, 2,4 Consider the following directed graph description: Set of vertices = {0,1, 2, 3, 4} and the Set of edges = {(0, 2), (0, 3), (1, 0), (2, 4), (3, 1), (3, 4)}. Vertex 0 is an articulation point in this graph. True False Kruskal's Algorithm will always maintain one tree at every stage of development. True False In an undirected graph, edge (v, w) = edge (w, v). True False A biconnected graph is a connected graph with an articulation point. True False