Recall that a bipartite graph is one whose vertices can be partitions into two disjoint subsets X and Y so that every edge connects a vertex in X with a vertex in Y. In the lectures we discussed how to use depth first search and breadth first search to check whether a graph is bipartite. Explain a brute force algorithm based on exhaustive search and that does not rely on depth first search or breadth first search to check whether a given graph is bipartite. Minimize the number of subsets the algorithm generates