A graph is said to be bipartite if all its vertices can be partitioned into two disjoint sbsetsX andY so that every edge connects a vertex inX with a vertex in Y.(One can also say that a graph is bipartite if its vertices can be colored in two colors so that every edge has its vertices colored in different colors; such graphs are also called 2-colorable.) For example, graph (i) is bipartite while graph () is not. (0 is bipartite while 1l b. Design a BFS-based algorithm for checking whether a graph is bipartite