1. (a) (2 points) Show the run of Breadth-First-Search (BFS) algorithm on the graph in Figure 1 starting from node 5, i.e., show which nodes will be discovered at layers 1, 2, and so on. 2 8 3 4 10 6 (b) (2 points) Is the above graph bipartite? Why? (c) (2 points) Let G be an undirected graph on n nodes, where n is an even number. If every node of G has degree at least n/2, then show that G is connected. (degree of a node u is defined as the total number of adjacent vertices of u, i.e., total neighbors of u)