A bipartite graph is an undirected graph whose nodes can be parti- tioned into two disjoint sets such that no edge exists between two nodes in the same set. Describe how breadth-rst search can be used to determine if a graph is bipartite or not (discuss, and use pseudocode). Note the graph need not be connected, so be sure to handle the the case when the graph is disconnected.