Let G be an undirected graph with n nodes and m edges stored as an adjacency list. Recall that G is bipartite (or two colorable) if and only if we can color each vertex either red or blue so that no edges go between vertices of the same color. Suppose we have run a DFS on G, yielding a DFS tree T. Describe how we can check if G is bipartite? (Hint: use the DFS tree to assign colors and check that the forward, back and cross edges satisfy the bipartite condition above).