A graph G = (V,E) is 2-colorable if each vertex can be labeled either red or blue in such a way that for any (u, v) 2 E, u and v are allotted different colors. Illustrate how to use depth-first search to find out in time O(|E|+|V |) whether undirected graph is 2-colorable. Describe and explain your strategy.