7. A graph is called bipartite if all its vertices can be partitioned in two two disjoint subsets Xand Y so that every edge connects a vertex in X with a vertex in Y. (a) Design a DFS-based algorithm for checking whether a graph is bipartite. (b) Design a BFS-based algorithm for checking whether a graph is bipartite