Run a Breadth Search (BFS) on the graph and find the level numbers of the vertices as well as identify the tree edges and cross edges

15 a Breadth First Search (BFS) on the graph and find the level numbers of the vertices as well as identify the tree edges and cross edges. Use the results to determine whether the graph is bipartite (2-colorable) or not. the graph is bipartite, identify the two partitions of the graph. If If graph from being the graph is not bipartite, identify the edges that prevent the bipartite