d) Information given is insufficient Q3: Given the graph below, which of the following is not a visit order of BFS algorithm? 8 (10 a) 13597410 852 b) 24536 +97+8+1 10 c) 316974 10 852 d) 431697 10 852 e) Other: Q4: For the given graph(G), which of the following statements is true? E a) G is a complete graph b) G is not a connected graph c) The vertex connectivity of the graph is 2 d) The edge connectivity of the graph is 1 Q5: The number of elements in the adjacency matrix of a graph having 7 vertices is a) 7 b) 14 c) 36 d) 49