(Test bipartite) Recall that a graph is bipartite if its vertices can be divided into two disjoint sets such that no edges exist between vertices in the same set. Define a new class named...

(Test bipartite) Recall that a graph is bipartite if its vertices can be divided into two disjoint sets such that no edges exist between vertices in the same set. Define a new class named UnweightedGraphTestBipartite with the following method to detect whether the graph is bipartite:

public boolean isBipartite();